System for a mesh network for use in aircrafts

ABSTRACT

In an aspect, a system for a mesh network for use in aircrafts is presented. A system includes a computing device. A computing devices is configured to generate a first node of a multi node network. A first node communicates data to an aircraft. A computing device is configured to communicate data to at least a second node of a multi node network. A computing device is configured to receive from at least a second node communication efficiency feedback. A computing device is configured to update a node of the multi node network as a function of communication efficiency feedback from other nodes of a multi node network. Updating includes selecting an initial recipient node from a plurality of nodes of a multi node network.

FIELD OF THE INVENTION

The present invention generally relates to the field of networking and data communication between multiple aircraft. In particular, the present invention relates to a mesh network for use in aircrafts.

BACKGROUND

Modern aircraft routinely communicate data about health, location, and flightpaths to a control tower. However, a data transmission to a control tower or other direct contact point may be unreliable and fail. Current systems and methods for secure communication across multiple contact points are inadequate.

SUMMARY OF THE DISCLOSURE

In an aspect, a system for a mesh network for use in aircrafts is presented. A system includes a computing device. A computing devices is configured to generate a first node of a multi node network. A first node communicates data to an aircraft. A computing device is configured to communicate data to at least a second node of a multi node network. A computing device is configured to receive from at least a second node communication efficiency feedback. A computing device is configured to update a node of the multi node network as a function of communication efficiency feedback from other nodes of a multi node network. Updating includes selecting an initial recipient node from a plurality of nodes of a multi node network.

In an aspect, a method of generating a mesh network for an aircraft. A method includes generating on a plurality of computing devices a plurality of nodes of a multi node network. A method includes communicating data between one node of a multi node network and another node of the multi node network. A method includes updating, as a function of communicated data, a node of a multi node network. A method includes selecting a transmission pathway of nodes of a multi node network.

These and other aspects and features of non-limiting embodiments of the present invention will become apparent to those skilled in the art upon review of the following description of specific non-limiting embodiments of the invention in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

For the purpose of illustrating the invention, the drawings show aspects of one or more embodiments of the invention. However, it should be understood that the present invention is not limited to the precise arrangements and instrumentalities shown in the drawings, wherein:

FIG. 1 is a block diagram of a system for a mesh network for an aircraft;

FIG. 2 is another block diagram of a system for a mesh network for an aircraft;

FIG. 3 is an exemplary embodiment of an aircraft;

FIG. 4 is an exemplary embodiment of a flight controller of an aircraft;

FIG. 5 is a block diagram of a machine learning model;

FIG. 6 is a flowchart for a method of generating a mesh network for an aircraft;

FIG. 7 is a schematic diagram illustrating exemplary embodiments of fuzzy sets; and

FIG. 8 is a block diagram of an exemplary embodiment of a computing system.

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. As used herein, the word “exemplary” or “illustrative” means “serving as an example, instance, or illustration.” Any implementation described herein as “exemplary” or “illustrative” is not necessarily to be construed as preferred or advantageous over other implementations. All of the implementations described below are exemplary implementations provided to enable persons skilled in the art to make or use the embodiments of the disclosure and are not intended to limit the scope of the disclosure, which is defined by the claims.

Described herein is a system for a mesh network for an aircraft is presented. In some embodiments, an aircraft may include an electric vertical and takeoff landing vehicle (eVTOL). A system includes a plurality of computing devices. Each computing device of the plurality of computing devices is configured to generate a node of a multi node network. In some embodiments, a node may be generated from an aircraft. A node communicates data to an aircraft. In some embodiments, data may include flight maneuver data. Communication may take place over cellular transmission. In some embodiments, communication may take place over at least two different transmission frequencies. A computing device is configured to communicate data to at least another node of a multi node network. A computing device is configured to update a node of the multi node network as a function of feedback from other nodes of a multi node network. A multi node network is configured to select a data transmission pathway of nodes as a function of an updating of nodes of the multi node network. In some embodiments, a node of a multi node network may be configured to forward a data transmission of one node to another node of the mesh network. In some embodiments, at least two aircraft may communicate data to one another directly through the multi node network. In some embodiments, a multi node network may include an encryption process. An encryption process may include a hash function.

Described herein is a method of generating a mesh network for an aircraft. An aircraft may include an eVTOL. A method includes generating on a plurality of computing devices a plurality of nodes of a multi node network. In some embodiments, a multi node network may be configured to communicate over cellular signals. In some embodiments, a node of the plurality of nodes may be generated from an aircraft. A method includes communicating data between one node of a plurality of nodes and another node of the plurality of nodes. In some embodiments, a node of the plurality of nodes may be configured to forward a data transmission to another node of the plurality of nodes. Data may include flight maneuver data. A method includes updating, as a function of communicated data, a node of a multi node network. In some embodiments, communicating may include at least two different transmission frequencies. In some embodiments, at least two aircraft may communicate data to one another directly through the multi node network. A method includes selecting a transmission pathway of nodes of a multi node network. In some embodiments, a multi node network may include an encryption process. An encryption process may include a hash function.

Referring now to FIG. 1, an exemplary embodiment of a system 100 for a mesh network for an electric aircraft is illustrated. System 100 may include a node 104. Node 104 may include any computing device as described in this disclosure, including without limitation a microcontroller, microprocessor, digital signal processor (DSP) and/or system on a chip (SoC) as described in this disclosure. Node 104 may include, be included in, and/or communicate with a mobile device such as a mobile telephone or smartphone. Node 104 may include a single computing device operating independently, or may include two or more computing device operating in concert, in parallel, sequentially or the like; two or more computing devices may be included together in a single computing device or in two or more computing devices. Node 104 may interface or communicate with one or more additional devices as described below in further detail via a network interface device. Network interface device may be utilized for connecting node 104 to one or more of a variety of networks, and one or more devices. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. A network may employ a wired and/or a wireless mode of communication. In general, any network topology may be used. Information (e.g., data, software etc.) may be communicated to and/or from a computer and/or a computing device. Node 104 may include but is not limited to, for example, a computing device or cluster of computing devices in a first location and a second computing device or cluster of computing devices in a second location. Node 104 may include one or more computing devices dedicated to data storage, security, distribution of traffic for load balancing, and the like. Node 104 may distribute one or more computing tasks as described below across a plurality of computing devices of computing device, which may operate in parallel, in series, redundantly, or in any other manner used for distribution of tasks or memory between computing devices. Node 104 may be implemented using a “shared nothing” architecture in which data is cached at the worker, in an embodiment, this may enable scalability of system 100 and/or computing device.

With continued reference to FIG. 1, node 104 may be designed and/or configured to perform any method, method step, or sequence of method steps in any embodiment described in this disclosure, in any order and with any degree of repetition. For instance, node 104 may be configured to perform a single step or sequence repeatedly until a desired or commanded outcome is achieved; repetition of a step or a sequence of steps may be performed iteratively and/or recursively using outputs of previous repetitions as inputs to subsequent repetitions, aggregating inputs and/or outputs of repetitions to produce an aggregate result, reduction or decrement of one or more variables such as global variables, and/or division of a larger processing task into a set of iteratively addressed smaller processing tasks. Node 104 may perform any step or sequence of steps as described in this disclosure in parallel, such as simultaneously and/or substantially simultaneously performing a step two or more times using two or more parallel threads, processor cores, or the like; division of tasks between parallel threads and/or processes may be performed according to any protocol suitable for division of tasks between iterations. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various ways in which steps, sequences of steps, processing tasks, and/or data may be subdivided, shared, or otherwise dealt with using iteration, recursion, and/or parallel processing.

Still referring to FIG. 1, system 100 may include a plurality of nodes. In some embodiments, system 100 may include and/or communicate with a second node 108. In some embodiments, system 100 may include and/or communicate with a third node 112. In some embodiments, system 100 may include and/or communicate with a fourth node 116. A “node” as used in this disclosure is a computing device that is configured to receive and transmit data to another computing device. A node may include any computing device, such as, but not limited to, an electric aircraft, a laptop, a smartphone, a tablet, a command deck, a recharging pad, and/or other computing devices. In some embodiments, node 104 may include a flight controller of an electric aircraft. In some embodiments, node 104, second node 108, third node 112, and fourth node 116 may include a flight controller of an electric aircraft. In some embodiments, an electric aircraft may include an unmanned aerial vehicle (UAV), eVTOL, quadcopter, or other vehicle. In some embodiments, node 104 may be configured to transmit and receive data from second node 108, third node 112, and/or fourth node 116. In some embodiments, second node 108 may be configured to transmit and receive data from node 104, third node 112, and/or fourth node 116. In some embodiments, third node 112 may be configured to transmit and receive data from node 104, second node 108, and/or fourth node 116. In some embodiments, fourth node 116 may be configured to transmit and receive data from first node 14, second node 108, and/or third node 112. System 100 may include and/or communicate with a plurality of nodes greater than four nodes. In some embodiments, system 100 may include less than four nodes. A node of system 100 may be configured to communicate data to another node of system 100. Data may include, but is not limited to, flight path data, battery charge data, locational data, speed data, acceleration data, propulsor data, power data, and/or other data. In some embodiments, data may include communication efficiency feedback. “Communication efficiency feedback,” as used in this disclosure, is any data concerning effectiveness of data transmission. In some embodiments, communication efficiency feedback may include, but is not limited to, signal strength, signal-noise ratio, error rate, availability of a higher-efficiency mode, physical trajectory of a second node, project change over time, relative strength of a third node, and the like. In some embodiments, system 100 may include and/or communicate with an initial recipient node. An “initial recipient node” as used in this disclosure is any node first transmitted to in a network. In some embodiments, first node 104 may include an initial recipient node. First node 104 may transmit data to second node 108. Second node 108 may transmit communication efficiency feedback to another node of system 100. In some embodiments, communication efficiency feedback may be based on data transmission times between two or more nodes. Communication efficiency feedback may be explicit. Explicit communication efficiency feedback may include second node 108 providing information to first node 104 about transmission times, error rates, signal-noise ratios, and the like. In some embodiments, second node 108 may provide communication efficiency feedback to first node 104 about one or more other nodes in system 100. Communication efficiency feedback about one or more other nodes of system 100 may include, but is not limited to, transmission speed, signal strength, error rate, signal-noise ratio, physical trajectory, availability, projected change over time, and the like. First node 104 may use communication efficiency feedback of second node 104 and/or one or more other nodes of system 100 to select an initial recipient node. Communication efficiency feedback may alternatively or additionally be implicit. Implicit communication efficiency feedback may include first node 104 detecting communication parameters such as, but not limited to, transmission speed, error rate, signal strength, physical trajectory, signal-noise ratio, and the like. First node 104 may determine one or more communication parameters based on a transmission between first node 104 and one or more other nodes of system 100. In some embodiments, first node 104 may store communication parameters of one or more other nodes. In a non-limiting example, first node 104 may store communication parameters of second node 104 which may include that second node 104 may have a high signal-noise ratio. First node 104 may search for another node of system 100 to select as an initial recipient node based on stored communication parameters of second node 108. In some embodiments, first node 104 may compare one or more communication parameters of a communication efficiency feedback of one or more nodes to select an initial recipient node. First node 104 may compare a communication efficiency feedback to a communication threshold. A “communication threshold” as used in this disclosure is any minimum or maximum value of a communication metric. A communication threshold may include, but is not limited to, an error rate, a transmission speed, a signal-noise ratio, a physical trajectory, a signal strength, and the like. In some embodiments, first node 104 may receive data from second node 108 about a third node, fourth node, etc. Data about a third node, fourth node, etc. may include communication efficiency feedback. First node 104 may use data received from second node 108 about another node to select from a plurality of nodes of system 100. First node 104 may utilize a machine-learning model to predict an optimal communication pathway of nodes. A machine-learning model may be trained on training data correlating communication parameters to selected initial recipient nodes. Training data may be obtained from prior transmissions, stored data of one or more nodes, and/or received from an external computing device. In some embodiments, training data may be obtained from a user input. First node 104 may utilize a machine-learning model to compare one or more nodes based on one or more communication parameters for an optimal pathway selection. A machine-learning model may be as described below with reference to FIG. 5.

Still referring to FIG. 1, first node 104 may generate an objective function to compare communication parameters of two or more nodes. An “objective function” as used in this disclosure is a process of maximizing or minimizing one or more values based on a set of constraints. In some embodiments, an objective function of generated by first node 104 may include an optimization criterion. An optimization criterion may include any description of a desired value or of values for one or more attributes of a communication pathway; desired value or range of values may include a maximal or minimal value, a range between maximal or minimal values, or an instruction to maximize or minimize an attribute. As a non-limiting example, an optimization criterion of at least an optimization criterion may specify that a communication should have a fast transmission time; an optimization criterion may cap error rates of a transmission. An optimization criterion may specify one or more thresholds for communication parameters in transmission pathways. An optimization criterion may specify one or more desired physical trajectories for a communication pathway. In an embodiment, at least an optimization criterion may assign weights to different attributes or values associated with attributes; weights, as used herein, may be multipliers or other scalar numbers reflecting a relative importance of a particular attribute or value. As a non-limiting example, minimization of response time may be multiplied by a first weight, while a communication threshold above a certain value may be multiplied by a second weight. Optimization criteria may be combined in weighted or unweighted combinations into a function reflecting an overall outcome desired by a user; function may be a communication function to be minimized and/or maximized. Function may be defined by reference to communication constraints and/or weighted aggregation thereof; for instance, a communication function combining optimization criteria may seek to minimize or maximize a function of communication constraints.

Still referring to FIG. 1, first node 104 may use an objective function to compare second node 104 to one or more other nodes. Generation of an objective function may include generation of a function to score and weight factors to achieve a communication score for each feasible pairing. In some embodiments, pairings may be scored in a matrix for optimization, where columns represent nodes and rows represent communications potentially paired therewith; each cell of such a matrix may represent a score of a pairing of the corresponding node to the corresponding communication. In some embodiments, assigning a predicted process that optimizes the objective function includes performing a greedy algorithm process. A “greedy algorithm” is defined as an algorithm that selects locally optimal choices, which may or may not generate a globally optimal solution. For instance, first node 104 may select pairings so that scores associated therewith are the best score for each order and/or for each process. In such an example, optimization may determine the combination of processes such that each object pairing includes the highest score possible.

Still referring to FIG. 1, an objective function may be formulated as a linear objective function. First node 104 may solve objective function 144 using a linear program such as without limitation a mixed-integer program. A “linear program,” as used in this disclosure, is a program that optimizes a linear objective function, given at least a constraint. For instance, and without limitation, objective function may seek to maximize a total score Σ_(r∈R) Σ_(s∈S) c_(rs)x_(rs), where R is a set of all nodes r, S is a set of all communications s, c_(rs) is a score of a pairing of a given node with a given communication, and x_(rs) is 1 if a node r is paired with a communication s, and 0 otherwise. Continuing the example, constraints may specify that each node is assigned to only one communication, and each communication is assigned only one node. Communications may include communications and/or transmissions as described above. Sets of communications may be optimized for a maximum score combination of all generated communications. In various embodiments, first node 104 may determine a combination of nodes that maximizes a total score subject to a constraint that all nodes are paired to exactly one communication. In some embodiments, not all communications may receive a node pairing since each communication may only use one node. In some embodiments, an objective function may be formulated as a mixed integer optimization function. A “mixed integer optimization” as used in this disclosure is a program in which some or all of the variables are restricted to be integers. A mathematical solver may be implemented to solve for the set of feasible pairings that maximizes the sum of scores across all pairings; mathematical solver may be implemented on first node 104 and/or another device in system 100, and/or may be implemented on third-party solver.

With continued reference to FIG. 1, optimizing an objective function may include minimizing a loss function, where a “loss function” is an expression an output of which an optimization algorithm minimizes to generate an optimal result. As a non-limiting example, first node 104 may assign variables relating to a set of parameters, which may correspond to a score of communications as described above, calculate an output of mathematical expression using the variables, and select a pairing that produces an output having the lowest size, according to a given definition of “size,” of the set of outputs representing each of plurality of candidate ingredient combinations; size may, for instance, included absolute value, numerical size, or the like. Selection of different loss functions may result in identification of different potential pairings as generating minimal outputs. Objectives represented in an objective function and/or loss function may include minimization of response times. Objectives may include minimization of error rate of transmission. Objectives may include minimization of nodes used. Objectives may include minimization of signal-noise ratio. Objectives may include minimization of physical trajectory.

Still referring to FIG. 1, first node 104 may use a fuzzy inferential system to determine an initial recipient node. “Fuzzy inference” is the process of formulating a mapping from a given input to an output using fuzzy logic. “Fuzzy logic” is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1. Fuzzy logic may be employed to handle the concept of partial truth, where the truth value may range between completely true and completely false. The mapping of a given input to an output using fuzzy logic may provide a basis from which decisions may be made and/or patterns discerned. A first fuzzy set may be represented, without limitation, according to a first membership function representing a probability that an input falling on a first range of values is a member of the first fuzzy set, where the first membership function has values on a range of probabilities such as without limitation the interval [0,1], and an area beneath the first membership function may represent a set of values within the first fuzzy set. A first membership function may include any suitable function mapping a first range to a probability interval, including without limitation a triangular function defined by two linear elements such as line segments or planes that intersect at or below the top of the probability interval.

Still referring to FIG. 1, a first fuzzy set may represent any value or combination of values as described above, including communication parameters. A second fuzzy set, which may represent any value which may be represented by first fuzzy set, may be defined by a second membership function on a second range; second range may be identical and/or overlap with first range and/or may be combined with first range via Cartesian product or the like to generate a mapping permitting evaluation overlap of first fuzzy set and second fuzzy set. Where first fuzzy set and second fuzzy set have a region that overlaps, first membership function and second membership function may intersect at a point representing a probability, as defined on probability interval, of a match between first fuzzy set and second fuzzy set. Alternatively or additionally, a single value of first and/or second fuzzy set may be located at a locus on a first range and/or a second range, where a probability of membership may be taken by evaluation of a first membership function and/or a second membership function at that range point. A probability may be compared to a threshold to determine whether a positive match is indicated. A threshold may, in a non-limiting example, represent a degree of match between a first fuzzy set and a second fuzzy set, and/or single values therein with each other or with either set, which is sufficient for purposes of the matching process. In some embodiments, there may be multiple thresholds. Each threshold may be established by one or more user inputs. Alternatively or additionally, each threshold may be tuned by a machine-learning and/or statistical process, for instance and without limitation as described in further detail below.

Still referring to FIG. 1, first node 104 may use a fuzzy inference system to determine a plurality of outputs based on a plurality of inputs. A plurality of outputs may include a communication efficiency of one or more nodes. A plurality of inputs may include communication efficiency feedback as described above. In a non-limiting example, first node 104 may detect that second node 108 may have slow response time and a far physical trajectory. First node 104 may determine, using fuzzy logic, that second node 108 is “too far” for selection as an initial recipient node. In another non-limiting example, first node 104 may detect that second node 108 may have a high transmission speed and a close physical trajectory. First node 104 may determine that second node 108 has a “strong signal”.

Still referring to FIG. 1, first node 104 may determine a connectivity of a plurality of potential initial recipient nodes. First node 104 may determine, using any process described in this disclosure, an optimal initial recipient node according to a selection criteria. A selection criteria may include, but is not limited to, physical trajectory, projected change over time, signal strength, error rate, transmission speeds, response times, neighboring nodes, and the like. In some embodiments, each node of system 100 may iteratively ID initial recipient nodes and calculate a best option score and an average score. Each node may send a best option score and/or an average score to all nodes of system 100. A node of system 100 may calculi and update a best option score and/or an average score based on data received from other nodes of system 100. In some embodiments, by having each node update a best option score and average score of their own initial recipient nodes, first node 104 may select an initial recipient node based on robustness and speed of each possible pathway of other nodes of system 100.

In some embodiments, and continuing to refer to FIG. 1, node 104 may be generated from a flight controller of an aircraft. In some embodiments, all nodes of system 100 may be generated from a flight controller of an aircraft. In some embodiments, one node of system 100 may be generated from an aircraft and another node may be generated from a landing pad and/or recharging station. In some embodiments, a node 104 may be generated from an electric aircraft and may communicate charging data to node 108 which may be generated from a charging infrastructure. An electric aircraft may communicate with a charging infrastructure through one or more nodes of system 100. Communication between an electric aircraft and a charging infrastructure may include, but is not limited to, data communication about charge status of an electric aircraft, charging standards of an electric aircraft, charging compatibility of the charger and the electric aircraft, estimated charging times, and the like.

Still referring to FIG. 1, in some embodiments, system 100 may include, participate in, and/or be incorporated in a network topology. A “network topology” as used in this disclosure is an arrangement of elements of a communication network. In some embodiments, system 100 may include, but is not limited to, a star network, tree network, and/or a mesh network. A “mesh network” as used in this disclosure is a local network topology in which the infrastructure nodes connect directly, dynamically, and non-hierarchically to as many other nodes as possible. Nodes of system 100 may be configured to communicate in a partial mesh network. A partial mesh network may include a communication system in which some nodes may be connected directly to one another while other nodes may need to connect to at least another node to reach a third node. In some embodiments, system 100 may be configured to communicate in a full mesh network. A full mesh network may include a communication system in which every node in the network may communicate directly to one another. In some embodiments, system 100 may include a layered data network. As used in this disclosure a “layered data network” is a data network with a plurality of substantially independent communication layers with each configured to allow for data transfer over predetermined bandwidths and frequencies. As used in this disclosure a “layer” is a distinct and independent functional and procedural tool of transferring data from one location to another. For example, and without limitation, one layer may transmit communication data at a particular frequency range while another layer may transmit communication data at another frequency range such that there is substantially no cross-talk between the two layers which advantageously provides a redundancy and safeguard in the event of a disruption in the operation of one of the layers. A layer may be an abstraction which is not tangible.

Still referring to FIG. 1, in some embodiments, system 100 may include node 104, second node 108, third node 112, and/or fourth node 116. Node 104 may be configured to communicate with a first layer providing radio communication between nodes at a first bandwidth. In some embodiments, node 104 may be configured to communicate with a second layer providing mobile network communication between the nodes at a second bandwidth. In some embodiments, node 104 may be configured to communicate with a third layer providing satellite communication between the nodes at a third bandwidth. In some embodiments, any node of system 100 may be configured to communicate with any layer of communication. In some embodiments, a node of system 100 may include an antenna configured to provide radio communication between one or more nodes. For example, and without limitation, an antenna may include a directional antenna. In an embodiment, system 100 may include a first bandwidth, a second bandwidth, and a third bandwidth. In some embodiments, system 100 may include more or less than three bandwidths. In some embodiments, a first bandwidth may be greater than a second bandwidth and a third bandwidth. In some embodiments, system 100 may be configured to provide mobile network communication in the form a cellular network, such as, but not limited to, 2G, 3G, 4G, 5G, LTE, and/or other cellular network standards.

Still referring to FIG. 1, radio communication, in accordance with embodiments, may utilize at least a communication band and communication protocols suitable for aircraft radio communication. For example, and without limitation, a very-high-frequency (VHF) air band with frequencies between about 108 MHz and about 137 MHz may be utilized for radio communication. In another example, and without limitation, frequencies in the Gigahertz range may be utilized. Airband or aircraft band is the name for a group of frequencies in the VHF radio spectrum allocated to radio communication in civil aviation, sometimes also referred to as VHF, or phonetically as “Victor”. Different sections of the band are used for radio-navigational aids and air traffic control. Radio communication protocols for aircraft are typically governed by the regulations of the Federal Aviation Authority (FAA) in the United States and by other regulatory authorities internationally. Radio communication protocols may employ, for example and without limitation an S band with frequencies in the range from about 2 GHz to about 4 GHz. For example, and without limitation, for 4G mobile network communication frequency bands in the range of about 2 GHz to about 8 GHz may be utilized, and for 5G mobile network communication frequency bands in the ranges of about 450 MHz to about 6 GHz and of about 24 GHz to about 53 GHz may be utilized. Mobile network communication may utilize, for example and without limitation, a mobile network protocol that allows users to move from one network to another with the same IP address. In some embodiments, a node of system 100 may be configured to transmit and/or receive a radio frequency transmission signal. A “radio frequency transmission signal,” as used in this disclosure, is an alternating electric current or voltage or of a magnetic, electric, or electromagnetic field or mechanical system in the frequency range from approximately 20 kHz to approximately 300 GHz. A radio frequency (RF) transmission signal may compose an analogue and/or digital signal received and be transmitted using functionality of output power of radio frequency from a transmitter to an antenna, and/or any RF receiver. A RF transmission signal may use longwave transmitter device for transmission of signals. An RF transmission signal may include a variety of frequency ranges, wavelength ranges, ITU designations, and IEEE bands including HF, VHF, UHF, L, S, C, X, Ku, K, Ka, V, W, mm, among others.

Still referring to FIG. 1, satellite communication, in accordance with embodiments, may utilize at least a communication band and communication protocols suitable for aircraft satellite communication. For example, and without limitation, satellite communication bands may include L-band (1-2 GHz), C-band (4-8 GHz), X-band (8-12 GHz), Ku-band (12-18 GHz), Ku-band (12-18 GHz), and the like, among others. Satellite communication protocols may employ, for example and without limitation, a Secondary Surveillance Radar (SSR) system, automated dependent surveillance-broadcast (ADS-B) system, or the like. In SSR, radar stations may use radar to interrogate transponders attached to or contained in aircraft and receive information in response describing such information as aircraft identity, codes describing flight plans, codes describing destination, and the like SSR may utilize any suitable interrogation mode, including Mode S interrogation for generalized information. ADS-B may implement two communication protocols, ADS-B-Out and ADS-B-In. ADS-B-Out may transmit aircraft position and ADS-B-In may receive aircraft position. Radio communication equipment may include any equipment suitable to carry on communication via electromagnetic waves at a particular bandwidth or bandwidth range, for example and without limitation, a receiver, a transmitter, a transceiver, an antenna, an aerial, and the like, among others. A mobile or cellular network communication equipment may include any equipment suitable to carry on communication via electromagnetic waves at a particular bandwidth or bandwidth range, for example and without limitation, a cellular phone, a smart phone, a personal digital assistant (PDA), a tablet, an antenna, an aerial, and the like, among others. A satellite communication equipment may include any equipment suitable to carry on communication via electromagnetic waves at a particular bandwidth or bandwidth range, for example and without limitation, a satellite data unit, an amplifier, an antenna, an aerial, and the like, among others.

Still referring to FIG. 1, as used in this disclosure “bandwidth” is measured as the amount of data that can be transferred from one point or location to another in a specific amount of time. The points or locations may be within a given network. Typically, bandwidth is expressed as a bitrate and measured in bits per second (bps). In some instances, bandwidth may also indicate a range within a band of wavelengths, frequencies, or energies, for example and without limitation, a range of radio frequencies which is utilized for a particular communication.

Still referring to FIG. 1, as used in this disclosure “antenna” is a rod, wire, aerial or other device used to transmit or receive signals such as, without limitation, radio signals and the like. A “directional antenna” or beam antenna is an antenna which radiates or receives greater power in specific directions allowing increased performance and reduced interference from unwanted sources. Typical examples of directional antennas include the Yagi antenna, the log-periodic antenna, and the corner reflector antenna. The directional antenna may include a high-gain antenna (HGA) which is a directional antenna with a focused, narrow radio wave beamwidth and a low-gain antenna (LGA) which is an omnidirectional antenna with a broad radio wave beamwidth, as needed or desired.

With continued reference to FIG. 1, as used in this disclosure, a “signal” is any intelligible representation of data, for example from one device to another. A signal may include an optical signal, a hydraulic signal, a pneumatic signal, a mechanical, signal, an electric signal, a digital signal, an analog signal and the like. In some cases, a signal may be used to communicate with a computing device, for example by way of one or more ports. In some cases, a signal may be transmitted and/or received by a computing device for example by way of an input/output port. An analog signal may be digitized, for example by way of an analog to digital converter. In some cases, an analog signal may be processed, for example by way of any analog signal processing steps described in this disclosure, prior to digitization. In some cases, a digital signal may be used to communicate between two or more devices, including without limitation computing devices. In some cases, a digital signal may be communicated by way of one or more communication protocols, including without limitation internet protocol (IP), controller area network (CAN) protocols, serial communication protocols (e.g., universal asynchronous receiver-transmitter [UART]), parallel communication protocols (e.g., IEEE 128 [printer port]), and the like.

Still referring to FIG. 1, in some cases, a node of system 100 may perform one or more signal processing steps on a sensed characteristic. For instance, a node may analyze, modify, and/or synthesize a signal representative of characteristic in order to improve the signal, for instance by improving transmission, storage efficiency, or signal to noise ratio. Exemplary methods of signal processing may include analog, continuous time, discrete, digital, nonlinear, and statistical. Analog signal processing may be performed on non-digitized or analog signals. Exemplary analog processes may include passive filters, active filters, additive mixers, integrators, delay lines, compandors, multipliers, voltage-controlled filters, voltage-controlled oscillators, and phase-locked loops. Continuous-time signal processing may be used, in some cases, to process signals which varying continuously within a domain, for instance time. Exemplary non-limiting continuous time processes may include time domain processing, frequency domain processing (Fourier transform), and complex frequency domain processing. Discrete time signal processing may be used when a signal is sampled non-continuously or at discrete time intervals (i.e., quantized in time). Analog discrete-time signal processing may process a signal using the following exemplary circuits sample and hold circuits, analog time-division multiplexers, analog delay lines and analog feedback shift registers. Digital signal processing may be used to process digitized discrete-time sampled signals. Commonly, digital signal processing may be performed by a computing device or other specialized digital circuits, such as without limitation an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a specialized digital signal processor (DSP). Digital signal processing may be used to perform any combination of typical arithmetical operations, including fixed-point and floating-point, real-valued and complex-valued, multiplication and addition. Digital signal processing may additionally operate circular buffers and lookup tables. Further non-limiting examples of algorithms that may be performed according to digital signal processing techniques include fast Fourier transform (FFT), finite impulse response (FIR) filter, infinite impulse response (IIR) filter, and adaptive filters such as the Wiener and Kalman filters. Statistical signal processing may be used to process a signal as a random function (i.e., a stochastic process), utilizing statistical properties. For instance, in some embodiments, a signal may be modeled with a probability distribution indicating noise, which then may be used to reduce noise in a processed signal.

Now referring to FIG. 2, a system 200 for a network is illustrated. In some embodiments, system 200 may include nodes 204, 208, 212, and 216. A network of nodes of system 200 may be configured as described above with respect to FIG. 1. System 200 shows inactive node 220. Inactive node 220 may include a physically damaged node generating component, data corrupted node, and/or powered down node. In a non-limiting example, node 204 may be configured to transmit data to inactive node 220. Inactive node 220 may be configured to relay data from node 204 to node 216. Node 204 may be configured to communicate with another node to relay data to node 216 in the case that inactive node 220 may not be functioning. In some embodiments, node 204 may be configured to relay data to node 208. Node 208 may be configured to relay data from node 204 to node 216. In some embodiments, node 204 may be configured to transmit data to node 212. Node 212 may be configured to relay data from node 204 to node 216. Any node of system 200 may be configured to relay data from one node to another through an alternate pathway in an event a node may be inactive. In some embodiments, nodes of system 200 may be configured to choose a data transmission pathway from one node to another node. A “data transmission pathway” as used in this disclosure is a selection of communication from one node to one or more other nodes. In some embodiments, a data transmission pathway may be calculated based on, but not limited to, signal strength, node distance, number of nodes, node traffic, inactive nodes, active nodes, and the like. In a non-limiting example, node 204 may transmit data to node 216 through node 212. Node 212 may have a slow response time communicating data to node 204. Node 204 may detect a slow response time of node 212 and update a pathway of transmission by communicating data to node 208 which may relay data to node 216. In some embodiments, system 200 may utilize a machine learning model to predict optimal data transmission pathways of nodes. A machine learning model may input a plurality of node connections and output an optimal data transmission pathway between nodes. In some embodiments, a machine learning model may be trained on training data correlating node connections to an optimal data transmission pathway. System 200 may utilize a machine learning model to update connections between nodes that may assist in transmission speed, data security, and the like.

Still referring to FIG. 2, in some embodiments, system 200 may include an encryption system. An encryption system may be implemented between one or more connections of nodes. In one embodiment, a cryptographic system may be a system that converts data from a first form, known as “plaintext,” which is intelligible when viewed in its intended format, into a second form, known as “ciphertext,” which is not intelligible when viewed in the same way. Ciphertext may be unintelligible in any format unless first converted back to plaintext. In one embodiment, a process of converting plaintext into ciphertext is known as “encryption.” Encryption process may involve the use of a datum, known as an “encryption key,” to alter plaintext. Cryptographic system may also convert ciphertext back into plaintext, which is a process known as “decryption.” Decryption process may involve the use of a datum, known as a “decryption key,” to return the ciphertext to its original plaintext form. In embodiments of cryptographic systems that are “symmetric,” decryption key is essentially the same as encryption key: possession of either key makes it possible to deduce the other key quickly without further secret knowledge. Encryption and decryption keys in symmetric cryptographic systems may be kept secret and shared only with persons or entities that the user of the cryptographic system wishes to be able to decrypt the ciphertext. One example of a symmetric cryptographic system is the Advanced Encryption Standard (“AES”), which arranges plaintext into matrices and then modifies the matrices through repeated permutations and arithmetic operations with an encryption key.

Still referring to FIG. 2, in some embodiments cryptographic systems may be “asymmetric,” either encryption or decryption key cannot be readily deduced without additional secret knowledge, even given the possession of a corresponding decryption or encryption key, respectively; a common example is a “public key cryptographic system,” in which possession of the encryption key does not make it practically feasible to deduce the decryption key, so that the encryption key may safely be made available to the public. An example of a public key cryptographic system is RSA, in which an encryption key involves the use of numbers that are products of very large prime numbers, but a decryption key involves the use of those very large prime numbers, such that deducing the decryption key from the encryption key requires the practically infeasible task of computing the prime factors of a number which is the product of two very large prime numbers. Another example is elliptic curve cryptography, which relies on the fact that given two points P and Q on an elliptic curve over a finite field, and a definition for addition where A+B=−R, the point where a line connecting point A and point B intersects the elliptic curve, where “0,” the identity, is a point at infinity in a projective plane containing the elliptic curve, finding a number k such that adding P to itself k times results in Q is computationally impractical, given correctly selected elliptic curve, finite field, and P and Q.

Still referring to FIG. 2, in some embodiments, systems and methods described herein produce cryptographic hashes, also referred to by the equivalent shorthand term “hashes.” A cryptographic hash, as used herein, is a mathematical representation of a lot of data, such as files or blocks in a block chain as described in further detail below; the mathematical representation is produced by a lossy “one-way” algorithm known as a “hashing algorithm.” Hashing algorithm may be a repeatable process; that is, identical lots of data may produce identical hashes each time they are subjected to a particular hashing algorithm. Because hashing algorithm is a one-way function, it may be impossible to reconstruct a lot of data from a hash produced from the lot of data using the hashing algorithm. In the case of some hashing algorithms, reconstructing the full lot of data from the corresponding hash using a partial set of data from the full lot of data may be possible only by repeatedly guessing at the remaining data and repeating the hashing algorithm; it is thus computationally difficult if not infeasible for a single computer to produce the lot of data, as the statistical likelihood of correctly guessing the missing data may be extremely low. However, the statistical likelihood of a computer of a set of computers simultaneously attempting to guess the missing data within a useful timeframe may be higher, permitting mining protocols as described in further detail below.

Still referring to FIG. 2, in an embodiment, a hashing algorithm may demonstrate an “avalanche effect,” whereby even extremely small changes to lot of data produce drastically different hashes. This may thwart attempts to avoid the computational work necessary to recreate a hash by simply inserting a fraudulent datum in data lot, enabling the use of hashing algorithms for “tamper-proofing” data such as data contained in an immutable ledger as described in further detail below. This avalanche or “cascade” effect may be evinced by various hashing processes; persons skilled in the art, upon reading the entirety of this disclosure, will be aware of various suitable hashing algorithms for purposes described herein. Verification of a hash corresponding to a lot of data may be performed by running the lot of data through a hashing algorithm used to produce the hash. Such verification may be computationally expensive, albeit feasible, potentially adding up to significant processing delays where repeated hashing, or hashing of large quantities of data, is required, for instance as described in further detail below. Examples of hashing programs include, without limitation, SHA256, a NIST standard; further current and past hashing algorithms include Winternitz hashing algorithms, various generations of Secure Hash Algorithm (including “SHA-1,” “SHA-2,” and “SHA-3”), “Message Digest” family hashes such as “MD4,” “MD5,” “MD6,” and “RIPEMD,” Keccak, “BLAKE” hashes and progeny (e.g., “BLAKE2,” “BLAKE-256,” “BLAKE-512,” and the like), Message Authentication Code (“MAC”)-family hash functions such as PMAC, OMAC, VMAC, HMAC, and UMAC, Poly1305-AES, Elliptic Curve Only Hash (“ECOH”) and similar hash functions, Fast-Syndrome-based (FSB) hash functions, GOST hash functions, the Grøstl hash function, the HAS-160 hash function, the JH hash function, the RadioGatún hash function, the Skein hash function, the Streebog hash function, the SWIFFT hash function, the Tiger hash function, the Whirlpool hash function, or any hash function that satisfies, at the time of implementation, the requirements that a cryptographic hash be deterministic, infeasible to reverse-hash, infeasible to find collisions, and have the property that small changes to an original message to be hashed will change the resulting hash so extensively that the original hash and the new hash appear uncorrelated to each other. A degree of security of a hash function in practice may depend both on the hash function itself and on characteristics of the message and/or digest used in the hash function. For example, where a message is random, for a hash function that fulfills collision-resistance requirements, a brute-force or “birthday attack” may to detect collision may be on the order of O (2^(n/2)) for n output bits; thus, it may take on the order of 2²⁵⁶ operations to locate a collision in a 512 bit output “Dictionary” attacks on hashes likely to have been generated from a non-random original text can have a lower computational complexity, because the space of entries they are guessing is far smaller than the space containing all random permutations of bits. However, the space of possible messages may be augmented by increasing the length or potential length of a possible message, or by implementing a protocol whereby one or more randomly selected strings or sets of data are added to the message, rendering a dictionary attack significantly less effective.

Continuing to refer to FIG. 2, a “secure proof,” as used in this disclosure, is a protocol whereby an output is generated that demonstrates possession of a secret, such as device-specific secret, without demonstrating the entirety of the device-specific secret; in other words, a secure proof by itself, is insufficient to reconstruct the entire device-specific secret, enabling the production of at least another secure proof using at least a device-specific secret. A secure proof may be referred to as a “proof of possession” or “proof of knowledge” of a secret. Where at least a device-specific secret is a plurality of secrets, such as a plurality of challenge-response pairs, a secure proof may include an output that reveals the entirety of one of the plurality of secrets, but not all of the plurality of secrets; for instance, secure proof may be a response contained in one challenge-response pair. In an embodiment, proof may not be secure; in other words, proof may include a one-time revelation of at least a device-specific secret, for instance as used in a single challenge-response exchange. Secure proof may include a zero-knowledge proof, which may provide an output demonstrating possession of a secret while revealing none of the secret to a recipient of the output; zero-knowledge proof may be information-theoretically secure, meaning that an entity with infinite computing power would be unable to determine secret from output.

With continued reference to FIG. 2, zero-knowledge proof may be computationally secure, meaning that determination of secret from output is computationally infeasible, for instance to the same extent that determination of a private key from a public key in a public key cryptographic system is computationally infeasible. Zero-knowledge proof algorithms may generally include a set of two algorithms, a prover algorithm, or “P,” which is used to prove computational integrity and/or possession of a secret, and a verifier algorithm, or “V” whereby a party may check the validity of P. Zero-knowledge proof may include an interactive zero-knowledge proof, wherein a party verifying the proof must directly interact with the proving party; for instance, the verifying and proving parties may be required to be online, or connected to the same network as each other, at the same time. Interactive zero-knowledge proof may include a “proof of knowledge” proof, such as a Schnorr algorithm for proof on knowledge of a discrete logarithm. in a Schnorr algorithm, a prover commits to a randomness r, generates a message based on r, and generates a message adding r to a challenge c multiplied by a discrete logarithm that the prover is able to calculate; verification is performed by the verifier who produced c by exponentiation, thus checking the validity of the discrete logarithm. Interactive zero-knowledge proofs may alternatively or additionally include sigma protocols. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various alternative interactive zero-knowledge proofs that may be implemented consistently with this disclosure.

Still referring to FIG. 2, alternatively, zero-knowledge proof may include a non-interactive zero-knowledge, proof, or a proof wherein neither party to the proof interacts with the other party to the proof; for instance, each of a party receiving the proof and a party providing the proof may receive a reference datum which the party providing the proof may modify or otherwise use to perform the proof. As a non-limiting example, zero-knowledge proof may include a succinct non-interactive arguments of knowledge (ZK-SNARKS) proof, wherein a “trusted setup” process creates proof and verification keys using secret (and subsequently discarded) information encoded using a public key cryptographic system, a prover runs a proving algorithm using the proving key and secret information available to the prover, and a verifier checks the proof using the verification key; public key cryptographic system may include RSA, elliptic curve cryptography, ElGamal, or any other suitable public key cryptographic system. Generation of trusted setup may be performed using a secure multiparty computation so that no one party has control of the totality of the secret information used in the trusted setup; as a result, if any one party generating the trusted setup is trustworthy, the secret information may be unrecoverable by malicious parties. As another non-limiting example, non-interactive zero-knowledge proof may include a Succinct Transparent Arguments of Knowledge (ZK-STARKS) zero-knowledge proof. In an embodiment, a ZK-STARKS proof includes a Merkle root of a Merkle tree representing evaluation of a secret computation at some number of points, which may be 1 billion points, plus Merkle branches representing evaluations at a set of randomly selected points of the number of points; verification may include determining that Merkle branches provided match the Merkle root, and that point verifications at those branches represent valid values, where validity is shown by demonstrating that all values belong to the same polynomial created by transforming the secret computation. In an embodiment, ZK-STARKS does not require a trusted setup.

Still referring to FIG. 2, zero-knowledge proof may include any other suitable zero-knowledge proof. Zero-knowledge proof may include, without limitation bulletproofs. Zero-knowledge proof may include a homomorphic public-key cryptography (hPKC)-based proof. Zero-knowledge proof may include a discrete logarithmic problem (DLP) proof. Zero-knowledge proof may include a secure multi-party computation (MPC) proof. Zero-knowledge proof may include, without limitation, an incrementally verifiable computation (IVC). Zero-knowledge proof may include an interactive oracle proof (IOP). Zero-knowledge proof may include a proof based on the probabilistically checkable proof (PCP) theorem, including a linear PCP (LPCP) proof. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various forms of zero-knowledge proofs that may be used, singly or in combination, consistently with this disclosure. In an embodiment, secure proof is implemented using a challenge-response protocol. In an embodiment, this may function as a one-time pad implementation; for instance, a manufacturer or other trusted party may record a series of outputs (“responses”) produced by a device possessing secret information, given a series of corresponding inputs (“challenges”), and store them securely. In an embodiment, a challenge-response protocol may be combined with key generation. A single key may be used in one or more digital signatures as described in further detail below, such as signatures used to receive and/or transfer possession of crypto-currency assets; the key may be discarded for future use after a set period of time. In an embodiment, varied inputs include variations in local physical parameters, such as fluctuations in local electromagnetic fields, radiation, temperature, and the like, such that an almost limitless variety of private keys may be so generated. Secure proof may include encryption of a challenge to produce the response, indicating possession of a secret key. Encryption may be performed using a private key of a public key cryptographic system, or using a private key of a symmetric cryptographic system; for instance, trusted party may verify response by decrypting an encryption of challenge or of another datum using either a symmetric or public-key cryptographic system, verifying that a stored key matches the key used for encryption as a function of at least a device-specific secret. Keys may be generated by random variation in selection of prime numbers, for instance for the purposes of a cryptographic system such as RSA that relies prime factoring difficulty. Keys may be generated by randomized selection of parameters for a seed in a cryptographic system, such as elliptic curve cryptography, which is generated from a seed. Keys may be used to generate exponents for a cryptographic system such as Diffie-Helman or ElGamal that are based on the discrete logarithm problem.

Still referring to FIG. 2, a “digital signature,” as used herein, includes a secure proof of possession of a secret by a signing device, as performed on provided element of data, known as a “message.” A message may include an encrypted mathematical representation of a file or other set of data using the private key of a public key cryptographic system. Secure proof may include any form of secure proof as described above, including without limitation encryption using a private key of a public key cryptographic system as described above. Signature may be verified using a verification datum suitable for verification of a secure proof; for instance, where secure proof is enacted by encrypting message using a private key of a public key cryptographic system, verification may include decrypting the encrypted message using the corresponding public key and comparing the decrypted representation to a purported match that was not encrypted; if the signature protocol is well-designed and implemented correctly, this means the ability to create the digital signature is equivalent to possession of the private decryption key and/or device-specific secret. Likewise, if a message making up a mathematical representation of file is well-designed and implemented correctly, any alteration of the file may result in a mismatch with the digital signature; the mathematical representation may be produced using an alteration-sensitive, reliably reproducible algorithm, such as a hashing algorithm as described above. A mathematical representation to which the signature may be compared may be included with signature, for verification purposes; in other embodiments, the algorithm used to produce the mathematical representation may be publicly available, permitting the easy reproduction of the mathematical representation corresponding to any file.

Still referring to FIG. 2, in some embodiments, digital signatures may be combined with or incorporated in digital certificates. In one embodiment, a digital certificate is a file that conveys information and links the conveyed information to a “certificate authority” that is the issuer of a public key in a public key cryptographic system. Certificate authority in some embodiments contains data conveying the certificate authority's authorization for the recipient to perform a task. The authorization may be the authorization to access a given datum. The authorization may be the authorization to access a given process. In some embodiments, the certificate may identify the certificate authority. The digital certificate may include a digital signature.

With continued reference to FIG. 2, in some embodiments, a third party such as a certificate authority (CA) is available to verify that the possessor of the private key is a particular entity; thus, if the certificate authority may be trusted, and the private key has not been stolen, the ability of an entity to produce a digital signature confirms the identity of the entity and links the file to the entity in a verifiable way. Digital signature may be incorporated in a digital certificate, which is a document authenticating the entity possessing the private key by authority of the issuing certificate authority and signed with a digital signature created with that private key and a mathematical representation of the remainder of the certificate. In other embodiments, digital signature is verified by comparing the digital signature to one known to have been created by the entity that purportedly signed the digital signature; for instance, if the public key that decrypts the known signature also decrypts the digital signature, the digital signature may be considered verified. Digital signature may also be used to verify that the file has not been altered since the formation of the digital signature.

Referring now to FIG. 3, an illustration of an exemplary embodiment of an aircraft 300 is shown. Aircraft 300 may include an electric vertical takeoff and landing aircraft (eVTOL). As used herein, a vertical take-off and landing (eVTOL) aircraft is one that may hover, take off, and land vertically. An eVTOL, as used herein, is an electrically powered aircraft typically using an energy source, of a plurality of energy sources to power the aircraft. In order to optimize the power and energy necessary to propel the aircraft. eVTOL may be capable of rotor-based cruising flight, rotor-based takeoff, rotor-based landing, fixed-wing cruising flight, airplane-style takeoff, airplane-style landing, and/or any combination thereof. Rotor-based flight, as described herein, is where the aircraft generated lift and propulsion by way of one or more powered rotors coupled with an engine, such as a “quad copter,” multi-rotor helicopter, or other vehicle that maintains its lift primarily using downward thrusting propulsors. Fixed-wing flight, as described herein, is where the aircraft is capable of flight using wings and/or foils that generate life caused by the aircraft's forward airspeed and the shape of the wings and/or foils, such as airplane-style flight.

With continued reference to FIG. 3, a number of aerodynamic forces may act upon the electric aircraft 300 during flight. Forces acting on an electric aircraft 300 during flight may include, without limitation, thrust, the forward force produced by the rotating element of the electric aircraft 300 and acts parallel to the longitudinal axis. Another force acting upon electric aircraft 300 may be, without limitation, drag, which may be defined as a rearward retarding force which is caused by disruption of airflow by any protruding surface of the electric aircraft 300 such as, without limitation, the wing, rotor, and fuselage. Drag may oppose thrust and acts rearward parallel to the relative wind. A further force acting upon electric aircraft 300 may include, without limitation, weight, which may include a combined load of the electric aircraft 300 itself, crew, baggage, and/or fuel. Weight may pull electric aircraft 300 downward due to the force of gravity. An additional force acting on electric aircraft 300 may include, without limitation, lift, which may act to oppose the downward force of weight and may be produced by the dynamic effect of air acting on the airfoil and/or downward thrust from the propulsor of the electric aircraft. Lift generated by the airfoil may depend on speed of airflow, density of air, total area of an airfoil and/or segment thereof, and/or an angle of attack between air and the airfoil. For example, and without limitation, electric aircraft 300 are designed to be as lightweight as possible. Reducing the weight of the aircraft and designing to reduce the number of components is essential to optimize the weight. To save energy, it may be useful to reduce weight of components of an electric aircraft 300, including without limitation propulsors and/or propulsion assemblies. In an embodiment, the motor may eliminate need for many external structural features that otherwise might be needed to join one component to another component. The motor may also increase energy efficiency by enabling a lower physical propulsor profile, reducing drag and/or wind resistance. This may also increase durability by lessening the extent to which drag and/or wind resistance add to forces acting on electric aircraft 300 and/or propulsors.

Referring still to FIG. 3, Aircraft may include at least a vertical propulsor 304 and at least a forward propulsor 308. A forward propulsor is a propulsor that propels the aircraft in a forward direction. Forward in this context is not an indication of the propulsor position on the aircraft; one or more propulsors mounted on the front, on the wings, at the rear, etc. A vertical propulsor is a propulsor that propels the aircraft in an upward direction; one of more vertical propulsors may be mounted on the front, on the wings, at the rear, and/or any suitable location. A propulsor, as used herein, is a component or device used to propel a craft by exerting force on a fluid medium, which may include a gaseous medium such as air or a liquid medium such as water. At least a vertical propulsor 304 is a propulsor that generates a substantially downward thrust, tending to propel an aircraft in a vertical direction providing thrust for maneuvers such as without limitation, vertical take-off, vertical landing, hovering, and/or rotor-based flight such as “quadcopter” or similar styles of flight.

With continued reference to FIG. 3, at least a forward propulsor 308 as used in this disclosure is a propulsor positioned for propelling an aircraft in a “forward” direction; at least a forward propulsor may include one or more propulsors mounted on the front, on the wings, at the rear, or a combination of any such positions. At least a forward propulsor may propel an aircraft forward for fixed-wing and/or “airplane”-style flight, takeoff, and/or landing, and/or may propel the aircraft forward or backward on the ground. At least a vertical propulsor 304 and at least a forward propulsor 308 includes a thrust element. At least a thrust element may include any device or component that converts the mechanical energy of a motor, for instance in the form of rotational motion of a shaft, into thrust in a fluid medium. At least a thrust element may include, without limitation, a device using moving or rotating foils, including without limitation one or more rotors, an airscrew or propeller, a set of airscrews or propellers such as contrarotating propellers, a moving or flapping wing, or the like. At least a thrust element may include without limitation a marine propeller or screw, an impeller, a turbine, a pump-jet, a paddle or paddle-based device, or the like. As another non-limiting example, at least a thrust element may include an eight-bladed pusher propeller, such as an eight-bladed propeller mounted behind the engine to ensure the drive shaft is in compression. Propulsors may include at least a motor mechanically coupled to the at least a first propulsor as a source of thrust. A motor may include without limitation, any electric motor, where an electric motor is a device that converts electrical energy into mechanical energy, for instance by causing a shaft to rotate. At least a motor may be driven by direct current (DC) electric power; for instance, at least a first motor may include a brushed DC at least a first motor, or the like. At least a first motor may be driven by electric power having varying or reversing voltage levels, such as alternating current (AC) power as produced by an alternating current generator and/or inverter, or otherwise varying power, such as produced by a switching power source. At least a first motor may include, without limitation, brushless DC electric motors, permanent magnet synchronous at least a first motor, switched reluctance motors, or induction motors. In addition to inverter and/or a switching power source, a circuit driving at least a first motor may include electronic speed controllers or other components for regulating motor speed, rotation direction, and/or dynamic braking. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various devices that may be used as at least a thrust element.

With continued reference to FIG. 3, during flight, a number of forces may act upon the electric aircraft. Forces acting on an aircraft 300 during flight may include thrust, the forward force produced by the rotating element of the aircraft 300 and acts parallel to the longitudinal axis. Drag may be defined as a rearward retarding force which is caused by disruption of airflow by any protruding surface of the aircraft 300 such as, without limitation, the wing, rotor, and fuselage. Drag may oppose thrust and acts rearward parallel to the relative wind. Another force acting on aircraft 300 may include weight, which may include a combined load of the aircraft 300 itself, crew, baggage and fuel. Weight may pull aircraft 300 downward due to the force of gravity. An additional force acting on aircraft 300 may include lift, which may act to oppose the downward force of weight and may be produced by the dynamic effect of air acting on the airfoil and/or downward thrust from at least a propulsor. Lift generated by the airfoil may depends on speed of airflow, density of air, total area of an airfoil and/or segment thereof, and/or an angle of attack between air and the airfoil.

Now referring to FIG. 4, an exemplary embodiment 400 of a flight controller 404 is illustrated. As used in this disclosure a “flight controller” is a computing device of a plurality of computing devices dedicated to data storage, security, distribution of traffic for load balancing, and flight instruction. Flight controller 404 may include and/or communicate with any computing device as described in this disclosure, including without limitation a microcontroller, microprocessor, digital signal processor (DSP) and/or system on a chip (SoC) as described in this disclosure. Further, flight controller 404 may include a single computing device operating independently, or may include two or more computing device operating in concert, in parallel, sequentially or the like; two or more computing devices may be included together in a single computing device or in two or more computing devices. In embodiments, flight controller 404 may be installed in an aircraft, may control the aircraft remotely, and/or may include an element installed in the aircraft and a remote element in communication therewith. In some embodiments, flight controller 404 may be configured to generate a node as described in FIG. 1.

In an embodiment, and still referring to FIG. 4, flight controller 404 may include a signal transformation component 408. As used in this disclosure a “signal transformation component” is a component that transforms and/or converts a first signal to a second signal, wherein a signal may include one or more digital and/or analog signals. For example, and without limitation, signal transformation component 408 may be configured to perform one or more operations such as preprocessing, lexical analysis, parsing, semantic analysis, and the like thereof. In an embodiment, and without limitation, signal transformation component 408 may include one or more analog-to-digital convertors that transform a first signal of an analog signal to a second signal of a digital signal. For example, and without limitation, an analog-to-digital converter may convert an analog input signal to a 10-bit binary digital representation of that signal. In another embodiment, signal transformation component 408 may include transforming one or more low-level languages such as, but not limited to, machine languages and/or assembly languages. For example, and without limitation, signal transformation component 408 may include transforming a binary language signal to an assembly language signal. In an embodiment, and without limitation, signal transformation component 408 may include transforming one or more high-level languages and/or formal languages such as but not limited to alphabets, strings, and/or languages. For example, and without limitation, high-level languages may include one or more system languages, scripting languages, domain-specific languages, visual languages, esoteric languages, and the like thereof. As a further non-limiting example, high-level languages may include one or more algebraic formula languages, business data languages, string and list languages, object-oriented languages, and the like thereof.

Still referring to FIG. 4, signal transformation component 408 may be configured to optimize an intermediate representation 412. As used in this disclosure an “intermediate representation” is a data structure and/or code that represents the input signal. Signal transformation component 408 may optimize intermediate representation as a function of a data-flow analysis, dependence analysis, alias analysis, pointer analysis, escape analysis, and the like thereof. In an embodiment, and without limitation, signal transformation component 408 may optimize intermediate representation 412 as a function of one or more inline expansions, dead code eliminations, constant propagation, loop transformations, and/or automatic parallelization functions. In another embodiment, signal transformation component 408 may optimize intermediate representation as a function of a machine dependent optimization such as a peephole optimization, wherein a peephole optimization may rewrite short sequences of code into more efficient sequences of code. Signal transformation component 408 may optimize intermediate representation to generate an output language, wherein an “output language,” as used herein, is the native machine language of flight controller 404. For example, and without limitation, native machine language may include one or more binary and/or numerical languages.

In an embodiment, and without limitation, signal transformation component 408 may include transform one or more inputs and outputs as a function of an error correction code. An error correction code, also known as error correcting code (ECC), is an encoding of a message or lot of data using redundant information, permitting recovery of corrupted data. An ECC may include a block code, in which information is encoded on fixed-size packets and/or blocks of data elements such as symbols of predetermined size, bits, or the like. Reed-Solomon coding, in which message symbols within a symbol set having q symbols are encoded as coefficients of a polynomial of degree less than or equal to a natural number k, over a finite field F with q elements; strings so encoded have a minimum hamming distance of k+1, and permit correction of (q−k−1)/2 erroneous symbols. Block code may alternatively or additionally be implemented using Golay coding, also known as binary Golay coding, Bose-Chaudhuri, Hocquenghuem (BCH) coding, multidimensional parity-check coding, and/or Hamming codes. An ECC may alternatively or additionally be based on a convolutional code.

In an embodiment, and still referring to FIG. 4, flight controller 404 may include a reconfigurable hardware platform 416. A “reconfigurable hardware platform,” as used herein, is a component and/or unit of hardware that may be reprogrammed, such that, for instance, a data path between elements such as logic gates or other digital circuit elements may be modified to change an algorithm, state, logical sequence, or the like of the component and/or unit. This may be accomplished with such flexible high-speed computing fabrics as field-programmable gate arrays (FPGAs), which may include a grid of interconnected logic gates, connections between which may be severed and/or restored to program in modified logic. Reconfigurable hardware platform 416 may be reconfigured to enact any algorithm and/or algorithm selection process received from another computing device and/or created using machine-learning processes.

Still referring to FIG. 4, reconfigurable hardware platform 416 may include a logic component 420. As used in this disclosure a “logic component” is a component that executes instructions on output language. For example, and without limitation, logic component may perform basic arithmetic, logic, controlling, input/output operations, and the like thereof. Logic component 420 may include any suitable processor, such as without limitation a component incorporating logical circuitry for performing arithmetic and logical operations, such as an arithmetic and logic unit (ALU), which may be regulated with a state machine and directed by operational inputs from memory and/or sensors; logic component 420 may be organized according to Von Neumann and/or Harvard architecture as a non-limiting example. Logic component 420 may include, incorporate, and/or be incorporated in, without limitation, a microcontroller, microprocessor, digital signal processor (DSP), Field Programmable Gate Array (FPGA), Complex Programmable Logic Device (CPLD), Graphical Processing Unit (GPU), general purpose GPU, Tensor Processing Unit (TPU), analog or mixed signal processor, Trusted Platform Module (TPM), a floating point unit (FPU), and/or system on a chip (SoC). In an embodiment, logic component 420 may include one or more integrated circuit microprocessors, which may contain one or more central processing units, central processors, and/or main processors, on a single metal-oxide-semiconductor chip. Logic component 420 may be configured to execute a sequence of stored instructions to be performed on the output language and/or intermediate representation 412. Logic component 420 may be configured to fetch and/or retrieve the instruction from a memory cache, wherein a “memory cache,” as used in this disclosure, is a stored instruction set on flight controller 404. Logic component 420 may be configured to decode the instruction retrieved from the memory cache to opcodes and/or operands. Logic component 420 may be configured to execute the instruction on intermediate representation 412 and/or output language. For example, and without limitation, logic component 420 may be configured to execute an addition operation on intermediate representation 412 and/or output language.

In an embodiment, and without limitation, logic component 420 may be configured to calculate a flight element 424. As used in this disclosure a “flight element” is an element of datum denoting a relative status of aircraft. For example, and without limitation, flight element 424 may denote one or more torques, thrusts, airspeed velocities, forces, altitudes, groundspeed velocities, directions during flight, directions facing, forces, orientations, and the like thereof. For example, and without limitation, flight element 424 may denote that aircraft is cruising at an altitude and/or with a sufficient magnitude of forward thrust. As a further non-limiting example, flight status may denote that is building thrust and/or groundspeed velocity in preparation for a takeoff. As a further non-limiting example, flight element 424 may denote that aircraft is following a flight path accurately and/or sufficiently.

Still referring to FIG. 4, flight controller 404 may include a chipset component 428. As used in this disclosure a “chipset component” is a component that manages data flow. In an embodiment, and without limitation, chipset component 428 may include a northbridge data flow path, wherein the northbridge dataflow path may manage data flow from logic component 420 to a high-speed device and/or component, such as a RAM, graphics controller, and the like thereof. In another embodiment, and without limitation, chipset component 428 may include a southbridge data flow path, wherein the southbridge dataflow path may manage data flow from logic component 420 to lower-speed peripheral buses, such as a peripheral component interconnect (PCI), industry standard architecture (ICA), and the like thereof. In an embodiment, and without limitation, southbridge data flow path may include managing data flow between peripheral connections such as ethernet, USB, audio devices, and the like thereof. Additionally or alternatively, chipset component 428 may manage data flow between logic component 420, memory cache, and a flight component 432. As used in this disclosure a “flight component” is a portion of an aircraft that can be moved or adjusted to affect one or more flight elements. For example, flight component 432 may include a component used to affect the aircrafts' roll and pitch which may comprise one or more ailerons. As a further example, flight component 432 may include a rudder to control yaw of an aircraft. In an embodiment, chipset component 428 may be configured to communicate with a plurality of flight components as a function of flight element 424. For example, and without limitation, chipset component 428 may transmit to an aircraft rotor to reduce torque of a first lift propulsor and increase the forward thrust produced by a pusher component to perform a flight maneuver.

In an embodiment, and still referring to FIG. 4, flight controller 404 may be configured generate an autonomous function. As used in this disclosure an “autonomous function” is a mode and/or function of flight controller 404 that controls aircraft automatically. For example, and without limitation, autonomous function may perform one or more aircraft maneuvers, take offs, landings, altitude adjustments, flight leveling adjustments, turns, climbs, and/or descents. As a further non-limiting example, autonomous function may adjust one or more airspeed velocities, thrusts, torques, and/or groundspeed velocities. As a further non-limiting example, autonomous function may perform one or more flight path corrections and/or flight path modifications as a function of flight element 424. In an embodiment, autonomous function may include one or more modes of autonomy such as, but not limited to, autonomous mode, semi-autonomous mode, and/or non-autonomous mode. As used in this disclosure “autonomous mode” is a mode that automatically adjusts and/or controls aircraft and/or the maneuvers of aircraft in its entirety. For example, autonomous mode may denote that flight controller 404 will adjust the aircraft. As used in this disclosure a “semi-autonomous mode” is a mode that automatically adjusts and/or controls a portion and/or section of aircraft. For example, and without limitation, semi-autonomous mode may denote that a pilot will control the propulsors, wherein flight controller 404 will control the ailerons and/or rudders. As used in this disclosure “non-autonomous mode” is a mode that denotes a pilot will control aircraft and/or maneuvers of aircraft in its entirety.

In an embodiment, and still referring to FIG. 4, flight controller 404 may generate autonomous function as a function of an autonomous machine-learning model. As used in this disclosure an “autonomous machine-learning model” is a machine-learning model to produce an autonomous function output given flight element 424 and a pilot signal 436 as inputs; this is in contrast to a non-machine learning software program where the commands to be executed are determined in advance by a user and written in a programming language. As used in this disclosure a “pilot signal” is an element of datum representing one or more functions a pilot is controlling and/or adjusting. For example, pilot signal 436 may denote that a pilot is controlling and/or maneuvering ailerons, wherein the pilot is not in control of the rudders and/or propulsors. In an embodiment, pilot signal 436 may include an implicit signal and/or an explicit signal. For example, and without limitation, pilot signal 436 may include an explicit signal, wherein the pilot explicitly states there is a lack of control and/or desire for autonomous function. As a further non-limiting example, pilot signal 436 may include an explicit signal directing flight controller 404 to control and/or maintain a portion of aircraft, a portion of the flight plan, the entire aircraft, and/or the entire flight plan. As a further non-limiting example, pilot signal 436 may include an implicit signal, wherein flight controller 404 detects a lack of control such as by a malfunction, torque alteration, flight path deviation, and the like thereof. In an embodiment, and without limitation, pilot signal 436 may include one or more explicit signals to reduce torque, and/or one or more implicit signals that torque may be reduced due to reduction of airspeed velocity. In an embodiment, and without limitation, pilot signal 436 may include one or more local and/or global signals. For example, and without limitation, pilot signal 436 may include a local signal that is transmitted by a pilot and/or crew member. As a further non-limiting example, pilot signal 436 may include a global signal that is transmitted by air traffic control and/or one or more remote users that are in communication with the pilot of aircraft. In an embodiment, pilot signal 436 may be received as a function of a tri-state bus and/or multiplexor that denotes an explicit pilot signal should be transmitted prior to any implicit or global pilot signal.

Still referring to FIG. 4, autonomous machine-learning model may include one or more autonomous machine-learning processes such as supervised, unsupervised, or reinforcement machine-learning processes that flight controller 404 and/or a remote device may or may not use in the generation of autonomous function. As used in this disclosure “remote device” is an external device to flight controller 404. Additionally or alternatively, autonomous machine-learning model may include one or more autonomous machine-learning processes that a field-programmable gate array (FPGA) may or may not use in the generation of autonomous function. Autonomous machine-learning process may include, without limitation machine learning processes such as simple linear regression, multiple linear regression, polynomial regression, support vector regression, ridge regression, lasso regression, elasticnet regression, decision tree regression, random forest regression, logistic regression, logistic classification, K-nearest neighbors, support vector machines, kernel support vector machines, naïve bayes, decision tree classification, random forest classification, K-means clustering, hierarchical clustering, dimensionality reduction, principal component analysis, linear discriminant analysis, kernel principal component analysis, Q-learning, State Action Reward State Action (SARSA), Deep-Q network, Markov decision processes, Deep Deterministic Policy Gradient (DDPG), or the like thereof.

In an embodiment, and still referring to FIG. 4, autonomous machine learning model may be trained as a function of autonomous training data, wherein autonomous training data may correlate a flight element, pilot signal, and/or simulation data to an autonomous function. For example, and without limitation, a flight element of an airspeed velocity, a pilot signal of limited and/or no control of propulsors, and a simulation data of required airspeed velocity to reach the destination may result in an autonomous function that includes a semi-autonomous mode to increase thrust of the propulsors. Autonomous training data may be received as a function of user-entered valuations of flight elements, pilot signals, simulation data, and/or autonomous functions. Flight controller 404 may receive autonomous training data by receiving correlations of flight element, pilot signal, and/or simulation data to an autonomous function that were previously received and/or determined during a previous iteration of generation of autonomous function. Autonomous training data may be received by one or more remote devices and/or FPGAs that at least correlate a flight element, pilot signal, and/or simulation data to an autonomous function. Autonomous training data may be received in the form of one or more user-entered correlations of a flight element, pilot signal, and/or simulation data to an autonomous function.

Still referring to FIG. 4, flight controller 404 may receive autonomous machine-learning model from a remote device and/or FPGA that utilizes one or more autonomous machine learning processes, wherein a remote device and an FPGA is described above in detail. For example, and without limitation, a remote device may include a computing device, external device, processor, FPGA, microprocessor and the like thereof. Remote device and/or FPGA may perform the autonomous machine-learning process using autonomous training data to generate autonomous function and transmit the output to flight controller 404. Remote device and/or FPGA may transmit a signal, bit, datum, or parameter to flight controller 404 that at least relates to autonomous function. Additionally or alternatively, the remote device and/or FPGA may provide an updated machine-learning model. For example, and without limitation, an updated machine-learning model may be comprised of a firmware update, a software update, a autonomous machine-learning process correction, and the like thereof. As a non-limiting example a software update may incorporate a new simulation data that relates to a modified flight element. Additionally or alternatively, the updated machine learning model may be transmitted to the remote device and/or FPGA, wherein the remote device and/or FPGA may replace the autonomous machine-learning model with the updated machine-learning model and generate the autonomous function as a function of the flight element, pilot signal, and/or simulation data using the updated machine-learning model. The updated machine-learning model may be transmitted by the remote device and/or FPGA and received by flight controller 404 as a software update, firmware update, or corrected autonomous machine-learning model. For example, and without limitation autonomous machine learning model may utilize a neural net machine-learning process, wherein the updated machine-learning model may incorporate a gradient boosting machine-learning process.

Still referring to FIG. 4, flight controller 404 may include, be included in, and/or communicate with a mobile device such as a mobile telephone or smartphone. Further, flight controller may communicate with one or more additional devices as described below in further detail via a network interface device. The network interface device may be utilized for commutatively connecting a flight controller to one or more of a variety of networks, and one or more devices. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. The network may include any network topology and can may employ a wired and/or a wireless mode of communication.

In an embodiment, and still referring to FIG. 4, flight controller 404 may include, but is not limited to, for example, a cluster of flight controllers in a first location and a second flight controller or cluster of flight controllers in a second location. Flight controller 404 may include one or more flight controllers dedicated to data storage, security, distribution of traffic for load balancing, and the like. Flight controller 404 may be configured to distribute one or more computing tasks as described below across a plurality of flight controllers, which may operate in parallel, in series, redundantly, or in any other manner used for distribution of tasks or memory between computing devices. For example, and without limitation, flight controller 404 may implement a control algorithm to distribute and/or command the plurality of flight controllers. As used in this disclosure a “control algorithm” is a finite sequence of well-defined computer implementable instructions that may determine the flight component of the plurality of flight components to be adjusted. For example, and without limitation, control algorithm may include one or more algorithms that reduce and/or prevent aviation asymmetry. As a further non-limiting example, control algorithms may include one or more models generated as a function of a software including, but not limited to Simulink by MathWorks, Natick, Mass., USA. In an embodiment, and without limitation, control algorithm may be configured to generate an auto-code, wherein an “auto-code,” is used herein, is a code and/or algorithm that is generated as a function of the one or more models and/or software's. In another embodiment, control algorithm may be configured to produce a segmented control algorithm. As used in this disclosure a “segmented control algorithm” is control algorithm that has been separated and/or parsed into discrete sections. For example, and without limitation, segmented control algorithm may parse control algorithm into two or more segments, wherein each segment of control algorithm may be performed by one or more flight controllers operating on distinct flight components.

In an embodiment, and still referring to FIG. 4, control algorithm may be configured to determine a segmentation boundary as a function of segmented control algorithm. As used in this disclosure a “segmentation boundary” is a limit and/or delineation associated with the segments of the segmented control algorithm. For example, and without limitation, segmentation boundary may denote that a segment in the control algorithm has a first starting section and/or a first ending section. As a further non-limiting example, segmentation boundary may include one or more boundaries associated with an ability of flight component 432. In an embodiment, control algorithm may be configured to create an optimized signal communication as a function of segmentation boundary. For example, and without limitation, optimized signal communication may include identifying the discrete timing required to transmit and/or receive the one or more segmentation boundaries. In an embodiment, and without limitation, creating optimized signal communication further comprises separating a plurality of signal codes across the plurality of flight controllers. For example, and without limitation the plurality of flight controllers may include one or more formal networks, wherein formal networks transmit data along an authority chain and/or are limited to task-related communications. As a further non-limiting example, communication network may include informal networks, wherein informal networks transmit data in any direction. In an embodiment, and without limitation, the plurality of flight controllers may include a chain path, wherein a “chain path,” as used herein, is a linear communication path comprising a hierarchy that data may flow through. In an embodiment, and without limitation, the plurality of flight controllers may include an all-channel path, wherein an “all-channel path,” as used herein, is a communication path that is not restricted to a particular direction. For example, and without limitation, data may be transmitted upward, downward, laterally, and the like thereof. In an embodiment, and without limitation, the plurality of flight controllers may include one or more neural networks that assign a weighted value to a transmitted datum. For example, and without limitation, a weighted value may be assigned as a function of one or more signals denoting that a flight component is malfunctioning and/or in a failure state.

Still referring to FIG. 4, the plurality of flight controllers may include a master bus controller. As used in this disclosure a “master bus controller” is one or more devices and/or components that are connected to a bus to initiate a direct memory access transaction, wherein a bus is one or more terminals in a bus architecture. Master bus controller may communicate using synchronous and/or asynchronous bus control protocols. In an embodiment, master bus controller may include flight controller 404. In another embodiment, master bus controller may include one or more universal asynchronous receiver-transmitters (UART). For example, and without limitation, master bus controller may include one or more bus architectures that allow a bus to initiate a direct memory access transaction from one or more buses in the bus architectures. As a further non-limiting example, master bus controller may include one or more peripheral devices and/or components to communicate with another peripheral device and/or component and/or the master bus controller. In an embodiment, master bus controller may be configured to perform bus arbitration. As used in this disclosure “bus arbitration” is method and/or scheme to prevent multiple buses from attempting to communicate with and/or connect to master bus controller. For example and without limitation, bus arbitration may include one or more schemes such as a small computer interface system, wherein a small computer interface system is a set of standards for physical connecting and transferring data between peripheral devices and master bus controller by defining commands, protocols, electrical, optical, and/or logical interfaces. In an embodiment, master bus controller may receive intermediate representation 412 and/or output language from logic component 420, wherein output language may include one or more analog-to-digital conversions, low bit rate transmissions, message encryptions, digital signals, binary signals, logic signals, analog signals, and the like thereof described above in detail.

Still referring to FIG. 4, master bus controller may communicate with a slave bus. As used in this disclosure a “slave bus” is one or more peripheral devices and/or components that initiate a bus transfer. For example, and without limitation, slave bus may receive one or more controls and/or asymmetric communications from master bus controller, wherein slave bus transfers data stored to master bus controller. In an embodiment, and without limitation, slave bus may include one or more internal buses, such as but not limited to a/an internal data bus, memory bus, system bus, front-side bus, and the like thereof. In another embodiment, and without limitation, slave bus may include one or more external buses such as external flight controllers, external computers, remote devices, printers, aircraft computer systems, flight control systems, and the like thereof.

In an embodiment, and still referring to FIG. 4, control algorithm may optimize signal communication as a function of determining one or more discrete timings. For example, and without limitation master bus controller may synchronize timing of the segmented control algorithm by injecting high priority timing signals on a bus of the master bus control. As used in this disclosure a “high priority timing signal” is information denoting that the information is important. For example, and without limitation, high priority timing signal may denote that a section of control algorithm is of high priority and should be analyzed and/or transmitted prior to any other sections being analyzed and/or transmitted. In an embodiment, high priority timing signal may include one or more priority packets. As used in this disclosure a “priority packet” is a formatted unit of data that is communicated between the plurality of flight controllers. For example, and without limitation, priority packet may denote that a section of control algorithm should be used and/or is of greater priority than other sections.

Still referring to FIG. 4, flight controller 404 may also be implemented using a “shared nothing” architecture in which data is cached at the worker, in an embodiment, this may enable scalability of aircraft and/or computing device. Flight controller 404 may include a distributer flight controller. As used in this disclosure a “distributer flight controller” is a component that adjusts and/or controls a plurality of flight components as a function of a plurality of flight controllers. For example, distributer flight controller may include a flight controller that communicates with a plurality of additional flight controllers and/or clusters of flight controllers. In an embodiment, distributed flight control may include one or more neural networks. For example, neural network also known as an artificial neural network, is a network of “nodes,” or data structures having one or more inputs, one or more outputs, and a function determining outputs based on inputs. Such nodes may be organized in a network, such as without limitation a convolutional neural network, including an input layer of nodes, one or more intermediate layers, and an output layer of nodes. Connections between nodes may be created via the process of “training” the network, in which elements from a training dataset are applied to the input nodes, a suitable training algorithm (such as Levenberg-Marquardt, conjugate gradient, simulated annealing, or other algorithms) is then used to adjust the connections and weights between nodes in adjacent layers of the neural network to produce the desired values at the output nodes. This process is sometimes referred to as deep learning.

Still referring to FIG. 4, a node may include, without limitation a plurality of inputs x_(i) that may receive numerical values from inputs to a neural network containing the node and/or from other nodes. Node may perform a weighted sum of inputs using weights w_(i) that are multiplied by respective inputs x_(i). Additionally or alternatively, a bias b may be added to the weighted sum of the inputs such that an offset is added to each unit in the neural network layer that is independent of the input to the layer. The weighted sum may then be input into a function φ, which may generate one or more outputs y. Weight w_(i) applied to an input x_(i) may indicate whether the input is “excitatory,” indicating that it has strong influence on the one or more outputs y, for instance by the corresponding weight having a large numerical value, and/or a “inhibitory,” indicating it has a weak effect influence on the one more inputs y, for instance by the corresponding weight having a small numerical value. The values of weights w_(i) may be determined by training a neural network using training data, which may be performed using any suitable process as described above. In an embodiment, and without limitation, a neural network may receive semantic units as inputs and output vectors representing such semantic units according to weights w_(i) that are derived using machine-learning processes as described in this disclosure.

Still referring to FIG. 4, flight controller may include a sub-controller 440. As used in this disclosure a “sub-controller” is a controller and/or component that is part of a distributed controller as described above; for instance, flight controller 404 may be and/or include a distributed flight controller made up of one or more sub-controllers. For example, and without limitation, sub-controller 440 may include any controllers and/or components thereof that are similar to distributed flight controller and/or flight controller as described above. Sub-controller 440 may include any component of any flight controller as described above. Sub-controller 440 may be implemented in any manner suitable for implementation of a flight controller as described above. As a further non-limiting example, sub-controller 440 may include one or more processors, logic components and/or computing devices capable of receiving, processing, and/or transmitting data across the distributed flight controller as described above. As a further non-limiting example, sub-controller 440 may include a controller that receives a signal from a first flight controller and/or first distributed flight controller component and transmits the signal to a plurality of additional sub-controllers and/or flight components.

Still referring to FIG. 4, flight controller may include a co-controller 444. As used in this disclosure a “co-controller” is a controller and/or component that joins flight controller 404 as components and/or nodes of a distributer flight controller as described above. For example, and without limitation, co-controller 444 may include one or more controllers and/or components that are similar to flight controller 404. As a further non-limiting example, co-controller 444 may include any controller and/or component that joins flight controller 404 to distributer flight controller. As a further non-limiting example, co-controller 444 may include one or more processors, logic components and/or computing devices capable of receiving, processing, and/or transmitting data to and/or from flight controller 404 to distributed flight control system. Co-controller 444 may include any component of any flight controller as described above. Co-controller 444 may be implemented in any manner suitable for implementation of a flight controller as described above.

In an embodiment, and with continued reference to FIG. 4, flight controller 404 may be designed and/or configured to perform any method, method step, or sequence of method steps in any embodiment described in this disclosure, in any order and with any degree of repetition. For instance, flight controller 404 may be configured to perform a single step or sequence repeatedly until a desired or commanded outcome is achieved; repetition of a step or a sequence of steps may be performed iteratively and/or recursively using outputs of previous repetitions as inputs to subsequent repetitions, aggregating inputs and/or outputs of repetitions to produce an aggregate result, reduction or decrement of one or more variables such as global variables, and/or division of a larger processing task into a set of iteratively addressed smaller processing tasks. Flight controller may perform any step or sequence of steps as described in this disclosure in parallel, such as simultaneously and/or substantially simultaneously performing a step two or more times using two or more parallel threads, processor cores, or the like; division of tasks between parallel threads and/or processes may be performed according to any protocol suitable for division of tasks between iterations. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various ways in which steps, sequences of steps, processing tasks, and/or data may be subdivided, shared, or otherwise dealt with using iteration, recursion, and/or parallel processing.

Referring now to FIG. 5, an exemplary embodiment of a machine-learning module 500 that may perform one or more machine-learning processes as described in this disclosure is illustrated. Machine-learning module may perform determinations, classification, and/or analysis steps, methods, processes, or the like as described in this disclosure using machine learning processes. A “machine learning process,” as used in this disclosure, is a process that automatedly uses training data 504 to generate an algorithm that will be performed by a computing device/module to produce outputs 508 given data provided as inputs 512; this is in contrast to a non-machine learning software program where the commands to be executed are determined in advance by a user and written in a programming language.

Still referring to FIG. 5, “training data,” as used herein, is data containing correlations that a machine-learning process may use to model relationships between two or more categories of data elements. For instance, and without limitation, training data 504 may include a plurality of data entries, each entry representing a set of data elements that were recorded, received, and/or generated together; data elements may be correlated by shared existence in a given data entry, by proximity in a given data entry, or the like. Multiple data entries in training data 504 may evince one or more trends in correlations between categories of data elements; for instance, and without limitation, a higher value of a first data element belonging to a first category of data element may tend to correlate to a higher value of a second data element belonging to a second category of data element, indicating a possible proportional or other mathematical relationship linking values belonging to the two categories. Multiple categories of data elements may be related in training data 504 according to various correlations; correlations may indicate causative and/or predictive links between categories of data elements, which may be modeled as relationships such as mathematical relationships by machine-learning processes as described in further detail below. Training data 504 may be formatted and/or organized by categories of data elements, for instance by associating data elements with one or more descriptors corresponding to categories of data elements. As a non-limiting example, training data 504 may include data entered in standardized forms by persons or processes, such that entry of a given data element in a given field in a form may be mapped to one or more descriptors of categories. Elements in training data 504 may be linked to descriptors of categories by tags, tokens, or other data elements; for instance, and without limitation, training data 504 may be provided in fixed-length formats, formats linking positions of data to categories such as comma-separated value (CSV) formats and/or self-describing formats such as extensible markup language (XML), JavaScript Object Notation (JSON), or the like, enabling processes or devices to detect categories of data.

Alternatively or additionally, and continuing to refer to FIG. 5, training data 504 may include one or more elements that are not categorized; that is, training data 504 may not be formatted or contain descriptors for some elements of data. Machine-learning algorithms and/or other processes may sort training data 504 according to one or more categorizations using, for instance, natural language processing algorithms, tokenization, detection of correlated values in raw data and the like; categories may be generated using correlation and/or other processing algorithms. As a non-limiting example, in a corpus of text, phrases making up a number “n” of compound words, such as nouns modified by other nouns, may be identified according to a statistically significant prevalence of n-grams containing such words in a particular order; such an n-gram may be categorized as an element of language such as a “word” to be tracked similarly to single words, generating a new category as a result of statistical analysis. Similarly, in a data entry including some textual data, a person's name may be identified by reference to a list, dictionary, or other compendium of terms, permitting ad-hoc categorization by machine-learning algorithms, and/or automated association of data in the data entry with descriptors or into a given format. The ability to categorize data entries automatedly may enable the same training data 504 to be made applicable for two or more distinct machine-learning algorithms as described in further detail below. Training data 504 used by machine-learning module 500 may correlate any input data as described in this disclosure to any output data as described in this disclosure.

Further referring to FIG. 5, training data may be filtered, sorted, and/or selected using one or more supervised and/or unsupervised machine-learning processes and/or models as described in further detail below; such models may include without limitation a training data classifier 516. Training data classifier 516 may include a “classifier,” which as used in this disclosure is a machine-learning model as defined below, such as a mathematical model, neural net, or program generated by a machine learning algorithm known as a “classification algorithm,” as described in further detail below, that sorts inputs into categories or bins of data, outputting the categories or bins of data and/or labels associated therewith. A classifier may be configured to output at least a datum that labels or otherwise identifies a set of data that are clustered together, found to be close under a distance metric as described below, or the like. Machine-learning module 500 may generate a classifier using a classification algorithm, defined as a processes whereby a computing device and/or any module and/or component operating thereon derives a classifier from training data 504. Classification may be performed using, without limitation, linear classifiers such as without limitation logistic regression and/or naive Bayes classifiers, nearest neighbor classifiers such as k-nearest neighbors classifiers, support vector machines, least squares support vector machines, fisher's linear discriminant, quadratic classifiers, decision trees, boosted trees, random forest classifiers, learning vector quantization, and/or neural network-based classifiers. As a non-limiting example, training data classifier 516 may classify elements of training data to data transmission pathways.

Still referring to FIG. 5, machine-learning module 500 may be configured to perform a lazy-learning process 520 and/or protocol, which may alternatively be referred to as a “lazy loading” or “call-when-needed” process and/or protocol, may be a process whereby machine learning is conducted upon receipt of an input to be converted to an output, by combining the input and training set to derive the algorithm to be used to produce the output on demand. For instance, an initial set of simulations may be performed to cover an initial heuristic and/or “first guess” at an output and/or relationship. As a non-limiting example, an initial heuristic may include a ranking of associations between inputs and elements of training data 504. Heuristic may include selecting some number of highest-ranking associations and/or training data 504 elements. Lazy learning may implement any suitable lazy learning algorithm, including without limitation a K-nearest neighbors algorithm, a lazy naïve Bayes algorithm, or the like; persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various lazy-learning algorithms that may be applied to generate outputs as described in this disclosure, including without limitation lazy learning applications of machine-learning algorithms as described in further detail below.

Alternatively or additionally, and with continued reference to FIG. 5, machine-learning processes as described in this disclosure may be used to generate machine-learning models 524. A “machine-learning model,” as used in this disclosure, is a mathematical and/or algorithmic representation of a relationship between inputs and outputs, as generated using any machine-learning process including without limitation any process as described above, and stored in memory; an input is submitted to a machine-learning model 524 once created, which generates an output based on the relationship that was derived. For instance, and without limitation, a linear regression model, generated using a linear regression algorithm, may compute a linear combination of input data using coefficients derived during machine-learning processes to calculate an output datum. As a further non-limiting example, a machine-learning model 524 may be generated by creating an artificial neural network, such as a convolutional neural network comprising an input layer of nodes, one or more intermediate layers, and an output layer of nodes. Connections between nodes may be created via the process of “training” the network, in which elements from a training data 504 set are applied to the input nodes, a suitable training algorithm (such as Levenberg-Marquardt, conjugate gradient, simulated annealing, or other algorithms) is then used to adjust the connections and weights between nodes in adjacent layers of the neural network to produce the desired values at the output nodes. This process is sometimes referred to as deep learning.

Still referring to FIG. 5, machine-learning algorithms may include at least a supervised machine-learning process 528. At least a supervised machine-learning process 528, as defined herein, include algorithms that receive a training set relating a number of inputs to a number of outputs, and seek to find one or more mathematical relations relating inputs to outputs, where each of the one or more mathematical relations is optimal according to some criterion specified to the algorithm using some scoring function. For instance, a supervised learning algorithm may include node connections as described above as inputs, data transmission pathways as outputs, and a scoring function representing a desired form of relationship to be detected between inputs and outputs; scoring function may, for instance, seek to maximize the probability that a given input and/or combination of elements inputs is associated with a given output to minimize the probability that a given input is not associated with a given output. Scoring function may be expressed as a risk function representing an “expected loss” of an algorithm relating inputs to outputs, where loss is computed as an error function representing a degree to which a prediction generated by the relation is incorrect when compared to a given input-output pair provided in training data 504. Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various possible variations of at least a supervised machine-learning process 528 that may be used to determine relation between inputs and outputs. Supervised machine-learning processes may include classification algorithms as defined above.

Further referring to FIG. 5, machine learning processes may include at least an unsupervised machine-learning processes 532. An unsupervised machine-learning process, as used herein, is a process that derives inferences in datasets without regard to labels; as a result, an unsupervised machine-learning process may be free to discover any structure, relationship, and/or correlation provided in the data. Unsupervised processes may not require a response variable; unsupervised processes may be used to find interesting patterns and/or inferences between variables, to determine a degree of correlation between two or more variables, or the like.

Still referring to FIG. 5, machine-learning module 500 may be designed and configured to create a machine-learning model 524 using techniques for development of linear regression models. Linear regression models may include ordinary least squares regression, which aims to minimize the square of the difference between predicted outcomes and actual outcomes according to an appropriate norm for measuring such a difference (e.g. a vector-space distance norm); coefficients of the resulting linear equation may be modified to improve minimization. Linear regression models may include ridge regression methods, where the function to be minimized includes the least-squares function plus term multiplying the square of each coefficient by a scalar amount to penalize large coefficients. Linear regression models may include least absolute shrinkage and selection operator (LASSO) models, in which ridge regression is combined with multiplying the least-squares term by a factor of 1 divided by double the number of samples. Linear regression models may include a multi-task lasso model wherein the norm applied in the least-squares term of the lasso model is the Frobenius norm amounting to the square root of the sum of squares of all terms. Linear regression models may include the elastic net model, a multi-task elastic net model, a least angle regression model, a LARS lasso model, an orthogonal matching pursuit model, a Bayesian regression model, a logistic regression model, a stochastic gradient descent model, a perceptron model, a passive aggressive algorithm, a robustness regression model, a Huber regression model, or any other suitable model that may occur to persons skilled in the art upon reviewing the entirety of this disclosure. Linear regression models may be generalized in an embodiment to polynomial regression models, whereby a polynomial equation (e.g. a quadratic, cubic or higher-order equation) providing a best predicted output/actual output fit is sought; similar methods to those described above may be applied to minimize error functions, as will be apparent to persons skilled in the art upon reviewing the entirety of this disclosure.

Continuing to refer to FIG. 5, machine-learning algorithms may include, without limitation, linear discriminant analysis. Machine-learning algorithm may include quadratic discriminate analysis. Machine-learning algorithms may include kernel ridge regression. Machine-learning algorithms may include support vector machines, including without limitation support vector classification-based regression processes. Machine-learning algorithms may include stochastic gradient descent algorithms, including classification and regression algorithms based on stochastic gradient descent. Machine-learning algorithms may include nearest neighbors algorithms. Machine-learning algorithms may include various forms of latent space regularization such as variational regularization. Machine-learning algorithms may include Gaussian processes such as Gaussian Process Regression. Machine-learning algorithms may include cross-decomposition algorithms, including partial least squares and/or canonical correlation analysis. Machine-learning algorithms may include naïve Bayes methods. Machine-learning algorithms may include algorithms based on decision trees, such as decision tree classification or regression algorithms. Machine-learning algorithms may include ensemble methods such as bagging meta-estimator, forest of randomized tress, AdaBoost, gradient tree boosting, and/or voting classifier methods. Machine-learning algorithms may include neural net algorithms, including convolutional neural net processes.

Referring now to FIG. 6, a method 600 of generating a mesh network for use in aircrafts is presented. At step 605, method 600 includes generating on a computing device a first node of a multi node network. A computing device may include, but is not limited to, a flight controller, laptop, charging station, landing pad, smartphone, tablet, controller tower, and the like. A first node of a multi node network may include any computing device that may be configured to receive and transmit data to one or more other computing devices. Computing devices and nodes may be as described in FIGS. 1-2.

Still referring to FIG. 6, at step 610, method 600 includes generating on a computing device a second node of a multi node network. A computing device may include, but is not limited to, a flight controller, laptop, charging station, landing pad, smartphone, tablet, controller tower, and the like. A second node of a multi node network may include any computing device that may be configured to receive and transmit data to one or more other computing devices. Computing devices and nodes may be as described in FIGS. 1-2.

Still referring to FIG. 6, at step 615, method 600 includes communication efficiency feedback data between a first node and second node of a multi node network. Communication efficiency feedback data may include signal strength, transmission times, error rate, physical trajectory, and the like. Communication efficiency feedback data may be as described in FIGS. 1-2.

Still referring to FIG. 6, at step 620, method 600 includes updating as a function of communication efficiency feedback data an initial recipient node. An initial recipient node may include a node first transmitted to in a network. Updating an initial recipient node may be as described in FIGS. 1-2. In some embodiments, updating a node may be as described in FIGS. 1-2.

Still referring to FIG. 6, at step 625, method 600 includes selecting a transmission pathway of nodes. Selecting a transmission pathway may include calculating a path of communication between one node and another node. Calculating a path of communication may include factors such as, but into limited to, node distance, number of node connections, node response time, node signal strength, node traffic, and the like. In some embodiments, selecting a transmission pathway may be as described in FIGS. 1-2.

Referring now to FIG. 7, an exemplary embodiment of fuzzy set comparison 700 is illustrated. A first fuzzy set 704 may be represented, without limitation, according to a first membership function 708 representing a probability that an input falling on a first range of values 716 is a member of the first fuzzy set 704, where the first membership function 708 has values on a range of probabilities such as without limitation the interval [0,1], and an area beneath the first membership function 708 may represent a set of values within first fuzzy set 704. Although first range of values 712 is illustrated for clarity in this exemplary depiction as a range on a single number line or axis, first range of values 712 may be defined on two or more dimensions, representing, for instance, a Cartesian product between a plurality of ranges, curves, axes, spaces, dimensions, or the like. First membership function 708 may include any suitable function mapping first range 712 to a probability interval, including without limitation a triangular function defined by two linear elements such as line segments or planes that intersect at or below the top of the probability interval. As a non-limiting example, triangular membership function may be defined as:

${y\left( {x,a,b,c} \right)} = \left\{ \begin{matrix} {0,{{{for}\mspace{14mu} x} > {c\mspace{14mu}{and}\mspace{14mu} x} < a}} \\ {\frac{x - a}{b - a},{{{for}\mspace{14mu} a} \leq x < b}} \\ {\frac{c - x}{c - b},{{{if}\mspace{14mu} b} < x \leq c}} \end{matrix} \right.$ a trapezoidal membership function may be defined as:

${y\left( {x,a,b,c,d} \right)} = {\max\left( {{\min\left( {\frac{x - a}{b - a},1,\frac{d - x}{d - c}} \right)},0} \right)}$ a sigmoidal function may be defined as:

${y\left( {x,a,c} \right)} = \frac{1}{1 - e^{- {a{({x - c})}}}}$ a Gaussian membership function may be defined as:

${y\left( {x,c,\sigma} \right)} = e^{{- \frac{1}{2}}{(\frac{x - c}{\sigma})}^{2}}$ and a bell membership function may be defined as:

${y\left( {x,a,b,c,} \right)} = \left\lbrack {1 + {\frac{x - c}{a}}^{2b}} \right\rbrack^{- 1}$ Persons skilled in the art, upon reviewing the entirety of this disclosure, will be aware of various alternative or additional membership functions that may be used consistently with this disclosure. A fuzzy set may include Cartesian products of two or more fuzzy sets as described above.

First fuzzy set 704 may represent any value or combination of values as described above, A second fuzzy set 716, which may represent any value which may be represented by first fuzzy set 704, may be defined by a second membership function 720 on a second range 724; second range 724 may be identical and/or overlap with first range 712 and/or may be combined with first range via Cartesian product or the like to generate a mapping permitting evaluation overlap of first fuzzy set 704 and second fuzzy set 716. Where first fuzzy set 704 and second fuzzy set 716 have a region 728 that overlaps, first membership function 708 and second membership function 720 may intersect at a point 732 representing a probability, as defined on probability interval, of a match between first fuzzy set 704 and second fuzzy set 716. Alternatively or additionally, a single value of first and/or second fuzzy set may be located at a locus 736 on first range 712 and/or second range 724, where a probability of membership may be taken by evaluation of first membership function 708 and/or second membership function 720 at that range point. A probability at 728 and/or 732 may be compared to a threshold 740 to determine whether a positive match is indicated. Threshold 740 may, in a non-limiting example, represent a degree of match between first fuzzy set 704 and second fuzzy set 716, and/or single values therein with each other or with either set, which is sufficient for purposes of the matching process; for instance, threshold may indicate a sufficient degree of overlap between fields and/or parameters represented by one or more fuzzy sets and/or Cartesian products thereof for combination to occur as described above. There may be multiple thresholds. Each threshold may be established by one or more user inputs. Alternatively or additionally, each threshold may be tuned by a machine-learning and/or statistical process, for instance and without limitation as described above.

It is to be noted that any one or more of the aspects and embodiments described herein may be conveniently implemented using one or more machines (e.g., one or more computing devices that are utilized as a user computing device for an electronic document, one or more server devices, such as a document server, etc.) programmed according to the teachings of the present specification, as will be apparent to those of ordinary skill in the computer art. Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those of ordinary skill in the software art. Aspects and implementations discussed above employing software and/or software modules may also include appropriate hardware for assisting in the implementation of the machine executable instructions of the software and/or software module.

Such software may be a computer program product that employs a machine-readable storage medium. A machine-readable storage medium may be any medium that is capable of storing and/or encoding a sequence of instructions for execution by a machine (e.g., a computing device) and that causes the machine to perform any one of the methodologies and/or embodiments described herein. Examples of a machine-readable storage medium include, but are not limited to, a magnetic disk, an optical disc (e.g., CD, CD-R, DVD, DVD-R, etc.), a magneto-optical disk, a read-only memory “ROM” device, a random access memory “RAM” device, a magnetic card, an optical card, a solid-state memory device, an EPROM, an EEPROM, and any combinations thereof. A machine-readable medium, as used herein, is intended to include a single medium as well as a collection of physically separate media, such as, for example, a collection of compact discs or one or more hard disk drives in combination with a computer memory. As used herein, a machine-readable storage medium does not include transitory forms of signal transmission.

Such software may also include information (e.g., data) carried as a data signal on a data carrier, such as a carrier wave. For example, machine-executable information may be included as a data-carrying signal embodied in a data carrier in which the signal encodes a sequence of instruction, or portion thereof, for execution by a machine (e.g., a computing device) and any related information (e.g., data structures and data) that causes the machine to perform any one of the methodologies and/or embodiments described herein.

Examples of a computing device include, but are not limited to, an electronic book reading device, a computer workstation, a terminal computer, a server computer, a handheld device (e.g., a tablet computer, a smartphone, etc.), a web appliance, a network router, a network switch, a network bridge, any machine capable of executing a sequence of instructions that specify an action to be taken by that machine, and any combinations thereof. In one example, a computing device may include and/or be included in a kiosk.

FIG. 8 shows a diagrammatic representation of one embodiment of a computing device in the exemplary form of a computer system 800 within which a set of instructions for causing a control system to perform any one or more of the aspects and/or methodologies of the present disclosure may be executed. It is also contemplated that multiple computing devices may be utilized to implement a specially configured set of instructions for causing one or more of the devices to perform any one or more of the aspects and/or methodologies of the present disclosure. Computer system 800 includes a processor 804 and a memory 808 that communicate with each other, and with other components, via a bus 812. Bus 812 may include any of several types of bus structures including, but not limited to, a memory bus, a memory controller, a peripheral bus, a local bus, and any combinations thereof, using any of a variety of bus architectures.

Processor 804 may include any suitable processor, such as without limitation a processor incorporating logical circuitry for performing arithmetic and logical operations, such as an arithmetic and logic unit (ALU), which may be regulated with a state machine and directed by operational inputs from memory and/or sensors; processor 804 may be organized according to Von Neumann and/or Harvard architecture as a non-limiting example. Processor 804 may include, incorporate, and/or be incorporated in, without limitation, a microcontroller, microprocessor, digital signal processor (DSP), Field Programmable Gate Array (FPGA), Complex Programmable Logic Device (CPLD), Graphical Processing Unit (GPU), general purpose GPU, Tensor Processing Unit (TPU), analog or mixed signal processor, Trusted Platform Module (TPM), a floating point unit (FPU), and/or system on a chip (SoC).

Memory 808 may include various components (e.g., machine-readable media) including, but not limited to, a random-access memory component, a read only component, and any combinations thereof. In one example, a basic input/output system 816 (BIOS), including basic routines that help to transfer information between elements within computer system 800, such as during start-up, may be stored in memory 808. Memory 808 may also include (e.g., stored on one or more machine-readable media) instructions (e.g., software) 820 embodying any one or more of the aspects and/or methodologies of the present disclosure. In another example, memory 808 may further include any number of program modules including, but not limited to, an operating system, one or more application programs, other program modules, program data, and any combinations thereof.

Computer system 800 may also include a storage device 824. Examples of a storage device (e.g., storage device 824) include, but are not limited to, a hard disk drive, a magnetic disk drive, an optical disc drive in combination with an optical medium, a solid-state memory device, and any combinations thereof. Storage device 824 may be connected to bus 812 by an appropriate interface (not shown). Example interfaces include, but are not limited to, SCSI, advanced technology attachment (ATA), serial ATA, universal serial bus (USB), IEEE 1394 (FIREWIRE), and any combinations thereof. In one example, storage device 824 (or one or more components thereof) may be removably interfaced with computer system 800 (e.g., via an external port connector (not shown)). Particularly, storage device 824 and an associated machine-readable medium 828 may provide nonvolatile and/or volatile storage of machine-readable instructions, data structures, program modules, and/or other data for computer system 800. In one example, software 820 may reside, completely or partially, within machine-readable medium 828. In another example, software 820 may reside, completely or partially, within processor 804.

Computer system 800 may also include an input device 832. In one example, a user of computer system 800 may enter commands and/or other information into computer system 800 via input device 832. Examples of an input device 832 include, but are not limited to, an alpha-numeric input device (e.g., a keyboard), a pointing device, a joystick, a gamepad, an audio input device (e.g., a microphone, a voice response system, etc.), a cursor control device (e.g., a mouse), a touchpad, an optical scanner, a video capture device (e.g., a still camera, a video camera), a touchscreen, and any combinations thereof. Input device 832 may be interfaced to bus 812 via any of a variety of interfaces (not shown) including, but not limited to, a serial interface, a parallel interface, a game port, a USB interface, a FIREWIRE interface, a direct interface to bus 812, and any combinations thereof. Input device 832 may include a touch screen interface that may be a part of or separate from display 836, discussed further below. Input device 832 may be utilized as a user selection device for selecting one or more graphical representations in a graphical interface as described above.

A user may also input commands and/or other information to computer system 800 via storage device 824 (e.g., a removable disk drive, a flash drive, etc.) and/or network interface device 840. A network interface device, such as network interface device 840, may be utilized for connecting computer system 800 to one or more of a variety of networks, such as network 844, and one or more remote devices 848 connected thereto. Examples of a network interface device include, but are not limited to, a network interface card (e.g., a mobile network interface card, a LAN card), a modem, and any combination thereof. Examples of a network include, but are not limited to, a wide area network (e.g., the Internet, an enterprise network), a local area network (e.g., a network associated with an office, a building, a campus or other relatively small geographic space), a telephone network, a data network associated with a telephone/voice provider (e.g., a mobile communications provider data and/or voice network), a direct connection between two computing devices, and any combinations thereof. A network, such as network 844, may employ a wired and/or a wireless mode of communication. In general, any network topology may be used. Information (e.g., data, software 820, etc.) may be communicated to and/or from computer system 800 via network interface device 840.

Computer system 800 may further include a video display adapter 852 for communicating a displayable image to a display device, such as display device 836. Examples of a display device include, but are not limited to, a liquid crystal display (LCD), a cathode ray tube (CRT), a plasma display, a light emitting diode (LED) display, and any combinations thereof. Display adapter 852 and display device 836 may be utilized in combination with processor 804 to provide graphical representations of aspects of the present disclosure. In addition to a display device, computer system 800 may include one or more other peripheral output devices including, but not limited to, an audio speaker, a printer, and any combinations thereof. Such peripheral output devices may be connected to bus 812 via a peripheral interface 856. Examples of a peripheral interface include, but are not limited to, a serial port, a USB connection, a FIREWIRE connection, a parallel connection, and any combinations thereof.

The foregoing has been a detailed description of illustrative embodiments of the invention. Various modifications and additions can be made without departing from the spirit and scope of this invention. Features of each of the various embodiments described above may be combined with features of other described embodiments as appropriate in order to provide a multiplicity of feature combinations in associated new embodiments. Furthermore, while the foregoing describes a number of separate embodiments, what has been described herein is merely illustrative of the application of the principles of the present invention. Additionally, although particular methods herein may be illustrated and/or described as being performed in a specific order, the ordering is highly variable within ordinary skill to achieve methods, systems, and software according to the present disclosure. Accordingly, this description is meant to be taken only by way of example, and not to otherwise limit the scope of this invention.

Exemplary embodiments have been disclosed above and illustrated in the accompanying drawings. It will be understood by those skilled in the art that various changes, omissions and additions may be made to that which is specifically disclosed herein without departing from the spirit and scope of the present invention. 

What is claimed is:
 1. A system for a mesh network for use in aircrafts, comprising: a computing device, wherein the computing device of is configured to: generate a first node of a multi node network, wherein the first node communicates data to an aircraft; communicate data to at least a second node of the multi node network; receive, from the at least a second node, communication efficiency feedback; and update the first node as a function of the communication efficiency feedback, wherein updating further comprises: iteratively identifying initial recipient nodes of a plurality of nodes of the multi node network as a function of a selection criterion; and selecting an initial recipient node from the plurality of nodes of the multi node network as a function of the iterative identification.
 2. The system of claim 1, wherein the aircraft includes an electric vertical takeoff and landing (eVTOL) vehicle.
 3. The system of claim 1, wherein the multi node network is configured to communicate with cellular signals.
 4. The system of claim 1, where each node of the multi node network is generated from an aircraft.
 5. The system of claim 1, wherein data communicated includes flight maneuver data.
 6. The system of claim 1, wherein the mesh network includes an encryption process.
 7. The system of claim 6, wherein the encryption process includes a hash function.
 8. The system of claim 1, wherein at least two aircraft communicate data to one another directly through the mesh network.
 9. The system of claim 1, wherein a node of the multi node network is configured to forward a data transmission of another node of the multi node network.
 10. The system of claim 1, wherein the multi node network includes at least two different transmission frequencies.
 11. A method of generating a mesh network for use in aircrafts, the method comprising: generating, on a computing device, a first node of a multi node network; generating, on a computing device, a second node of the multi node network; communicating, communication efficiency feedback data between the first node of the multi node network and the second node of the multi node network; updating, as a function of the communication efficiency feedback data, an initial recipient node of the multi node network; wherein updating further comprises: iteratively identifying initial recipient nodes of a plurality of nodes of the multi node network as a function of a selection criterion; selecting an initial recipient node from the plurality of nodes of the multi node network; and selecting, a transmission pathway of nodes of the multi node network.
 12. The method of claim 11, wherein the initial recipient node includes an electric vertical takeoff and landing (eVTOL) vehicle.
 13. The method of claim 11, wherein the multi node network is configured to communicate with cellular signals.
 14. The method of claim 11, where each node of the plurality of nodes is generated from an aircraft.
 15. The method of claim 11, wherein data communicated includes flight maneuver data.
 16. The method of claim 11, wherein the mesh network includes an encryption process.
 17. The method of claim 16, wherein the encryption process includes a hash function.
 18. The method of claim 11, wherein at least two aircraft communicate data to one another directly through the mesh network.
 19. The method of claim 11, wherein a node of the plurality of nodes is configured to forward a data transmission to another node.
 20. The method of claim 11, wherein communicating includes at least two different transmission frequencies. 